Publications

Export 7151 results:
Author Title [ Type(Desc)] Year
Journal Articles
Friedman N, Getoor L.  1999.  Efficient learning using constrained sufficient statistics. Proceedings of the 7th International Workshop on Artificial Intelligence and Statistics (AISTATS-99).
Bhat G, Cleaveland R.  1996.  Efficient local model-checking for fragments of the modal $\mu$-calculus. Tools and Algorithms for the Construction and Analysis of Systems. :107-126.
Morselli R, Bhattacharjee B, Marsh MA, Srinivasan A.  2007.  Efficient lookup on unstructured topologies. IEEE Journal on Selected Areas in Communications. 25(1):62-72.
Tikir MM, Hollingsworth J.  2005.  Efficient online computation of statement coverage. Journal of Systems and Software. 78(2):146-165.
JaJa JF, Ryu KW.  1994.  An efficient parallel algorithm for the single function coarsest partition problem. Theoretical computer science. 129(2):293-307.
Landau GM, Vishkin U.  1986.  Efficient Parallel and Serial String Matching. Computer Science Department Technical Report. 221
Tarjan RE, Vishkin U.  1985.  An efficient parallel biconnectivity algorithm. SIAM Journal on Computing. 14:862-862.
Salmela P, Gu R, Bhattacharyya SS, Takala J.  2007.  Efficient parallel memory organization for turbo decoders. Red. 5
Luo Y, Duraiswami R.  2011.  EFFICIENT PARALLEL NON-NEGATIVE LEAST SQUARES ON MULTI-CORE ARCHITECTURES. SIAM Journal on Scientific Computing. 33(5):2848-2863.
Vishkin U.  1985.  On efficient parallel strong orientation. Information Processing Letters. 20(5):235-240.
Dorr BJ, Lee J, Lin D, Suh S.  1995.  Efficient parsing for Korean and English: A parameterized message-passing approach. Computational Linguistics. 21(2):255-263.
Katz J, Ostrovsky R, Yung M.  2001.  Efficient password-authenticated key exchange using human-memorable passwords. Advances in Cryptology—EUROCRYPT 2001. :475-494.
Amir A, Landau GM, Vishkin U.  1992.  Efficient pattern matching with scaling. Journal of Algorithms. 13(1):2-32.
Banerjee S, Kommareddy C, Bhattacharjee B.  2004.  Efficient peer location on the Internet. Computer Networks. 45(1):5-17.
Shin M, Arbaugh WA.  2009.  Efficient peer-to-Peer lookup in multi-hop wireless networks. KSII Trans. Internet and Information Systems. 3(1):5-25.
Gopalakrishnan V, Bhattacharjee B, Chawathe S, Keleher P.  2004.  Efficient peer-to-peer namespace searches. University of Maryland, College Park, MD, Tech. Rep. CSTR-4568.
Bhattacharjee B, Chawathe S, Gopalakrishnan V, Keleher P, Silaghi B.  2003.  Efficient peer-to-peer searches using result-caching. Peer-to-Peer Systems II. :225-236.
Kurc T, Uysal M, Eom H, Hollingsworth J, Saltz J, Sussman A.  2000.  Efficient performance prediction for large-scale, data-intensive applications. International Journal of High Performance Computing Applications. 14(3):216-216.
Roussopoulos N, Faloutsos C, Sellis T.  1988.  An efficient pictorial database system for PSQL. IEEE Transactions on Software Engineering. 14(5):639-650.
Huang Y, Malka L, Evans D, Katz J.  2011.  Efficient privacy-preserving biometric identification. Network and Distributed System Security Symposium.
Mount D, Netanyahu NS.  2001.  Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. Computational Geometry. 19(1):1-33.
Matoušek J, Mount D, Netanyahu NS.  1998.  Efficient randomized algorithms for the repeated median line estimator. Algorithmica. 20(2):136-150.
Fuchsbauer G, Katz J, Naccache D.  2010.  Efficient rational secret sharing in standard communication networks. Theory of Cryptography. :419-436.
Huang Y, Shen C, Evans D, Katz J, Shelat A.  2011.  Efficient Secure Computation with Garbled Circuits. Information Systems Security. :28-48.
Goh EJ, Jarecki S, Katz J, Wang N.  2007.  Efficient signature schemes with tight reductions to the Diffie-Hellman problems. Journal of Cryptology. 20(4):493-514.

Pages