Publications

Export 7148 results:
[ Author(Desc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
C
Cuntoor NP, Chellappa R.  2007.  Mixed-state models for nonstationary multiobject activities. EURASIP J. Appl. Signal Process.. 2007(1):106-106.
Cuntoor NP, Yegnanarayana B, Chellappa R.  2005.  Interpretation of state sequences in HMM for activity representation. Proc. IEEE Conf. Acoustic Speech and Signal Processing. 2:709-712.
D
D'Angelo J, Mayergoyz ID.  1993.  RF scattering and radiation by using a decoupled Helmholtz equation approach. Magnetics, IEEE Transactions on. 29(2):2040-2042.
D'Autrechy CL, Reggia JA.  1989.  Parallel plan execution with self-processing networks. Telematics and Informatics. 6(3-4):145-157.
D'Autrechy CL, Reggia JA, Sutton GG, Goodall SM.  1988.  A general-purpose simulation environment for developing connectionist models. Simulation. 51(1):5-5.
D'Autrechy CL, Reggia JA, Berndt RS.  1992.  Software approaches to segmentation analysis. Computer Science Technical Report Series; Vol. CS-TR-2991. :24-24.
Dachman-Soled D, Malkin T, Raykova M, Yung M.  2011.  Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications. Applied Cryptography and Network Security. :130-146.
Dachman-Soled D, Servedio RA.  2007.  Distribution-Free Testing Lower Bounds for Basic Boolean Functions. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :494-508.
Dachman-Soled D, Malkin T, Raykova M, Venkitasubramaniam M.  2013.  Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments. Advances in Cryptology - ASIACRYPT 2013. :316-336.
Dachman-Soled D, Sreedhar V.C..  2007.  Configuration Reasoning and Ontology For Web. IEEE International Conference on Services Computing, 2007. SCC 2007. :387-394.
Dachman-Soled D, Lee HK, Malkin T, Servedio RA, Wan A, Wee H.  2008.  Optimal Cryptographic Hardness of Learning Monotone Functions. Automata, Languages and Programming. :36-47.
Dachman-Soled D, Servedio RA.  2011.  A Canonical Form for Testing Boolean Function Properties. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :460-471.
Dachman-Soled D, Gennaro R, Krawczyk H, Malkin T.  2012.  Computational Extractors and Pseudorandomness. Theory of Cryptography. :383-403.
Dachman-Soled D, Frenkel AI.  2007.  Geometrical Characteristics of Regular Polyhedra: Application to EXAFS Studies of Nanoclusters. X-RAY ABSORPTION FINE STRUCTURE - XAFS13: 13th International Conference. 882:746-748.
Dachman-Soled D, Mahmoody M, Malkin T.  2014.  Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? Theory of Cryptography. :217-239.
Dachman-Soled D, Lindell Y, Mahmoody M, Malkin T.  2011.  On the Black-Box Complexity of Optimally-Fair Coin Tossing. Theory of Cryptography. :450-467.
Dachman-Soled D, Malkin T, Raykova M, Yung M.  2009.  Efficient Robust Private Set Intersection. Applied Cryptography and Network Security. :125-142.
Dachman-Soled D, Kalai YTauman.  2012.  Securing Circuits against Constant-Rate Tampering. Advances in Cryptology – CRYPTO 2012. :533-551.
Dachman-Soled D.  2014.  On Minimal Assumptions for Sender-Deniable Public Key Encryption. Public-Key Cryptography – PKC 2014. :574-591.
Daescu O, Luo J, Mount D.  2006.  Proximity problems on line segments spanned by points. Computational Geometry. 33(3):115-129.
Dagon D, Feamster N, Lee W, Edmonds R, Lipton R, Ramachandran A.  2008.  Method and System for Detecting and Responding to Attacking Networks. 11/538,212
DANČÍK V, Hannenhalli S, Muthukrishnan S.  1997.  Hardness of flip-cut problems from optical mapping. Journal of Computational Biology. 4(2):119-125.
Dancik V, Hannenhalli S, Muthukrishnan S.  1997.  Hardness of flip-cut problems from optical mapping [DNA molecules application]. Compression and Complexity of Sequences 1997. Proceedings. :275-284.
Dang G, North C, Shneiderman B.  2005.  Dynamic Queries and Brushing on Choropleth Maps (2001). Institute for Systems Research Technical Reports.
Dang G, North C, Shneiderman B.  2001.  Dynamic queries and brushing on choropleth maps. Fifth International Conference on Information Visualisation, 2001. Proceedings. :757-764.

Pages