Publications

Export 566 results:
Author Title [ Type(Desc)] Year
Filters: First Letter Of Last Name is V  [Clear All Filters]
Conference Papers
Balkan AO, Qu G, Vishkin U.  2008.  An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing. Proceedings of the 45th annual Design Automation Conference. :435-440.
Vasan A, Memon AM.  2004.  ASPIRE: automated systematic protocol implementation robustness evaluation. Software Engineering Conference, 2004. Proceedings. 2004 Australian. :241-250.
Voll K, Tom Yeh, Dahl V.  2000.  An assumptive logic programming methodology for parsing. Tools with Artificial Intelligence, 2000. ICTAI 2000. Proceedings. 12th IEEE International Conference on. :11-18.
Balch T, Khan Z, Veloso M.  2001.  Automatically Tracking and Analyzing the Behavior of Live Insect Colonies. AGENTS '01 Proceedings of the Fifth International Conference on Autonomous Agents . :521-528.
Oh S, Hoogs A, Perera A, Cuntoor N, Chen C-C, Lee J T, Mukherjee S, Aggarwal JK, Lee H, Davis LS et al..  2011.  AVSS 2011 demo session: A large-scale benchmark dataset for event recognition in surveillance video. Advanced Video and Signal-Based Surveillance (AVSS), 2011 8th IEEE International Conference on. :527-528.
Vishkin U, Smolyaninov I.  2004.  Bending light for multi-chip virtual PRAMs? Proc. 3rd Workshop on Non-Slicon Computation, held in conjunction with the 31st International Symposium on Computer Architecture (ISCA 2004). :19-23.
Vishkin U.  1992.  Biconnectivity Approximations and Graph Carvings. Proceedings of the Twenty-fourth Annual ACM Symposium on the Theory of Computing, Victoria, British Columbia, Canada, May 4-6, 1992. :759-759.
Elaine Shi, Perrig A, Van Doorn L.  2005.  BIND: a fine-grained attestation service for secure distributed systems. :154-168.
Caragea GC, Vishkin U.  2011.  Brief announcement: better speedups for parallel max-flow. Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures. :131-134.
Caragea GC, Saybasili AB, Wen X, Vishkin U.  2009.  Brief announcement: performance potential of an easy-to-program PRAM-on-chip prototype versus state-of-the-art processor. Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures. :163-165.
Vishkin U.  1991.  Can parallel algorithms enhance serial implementation? Parallel Processing Symposium, 1994. Proceedings., Eighth International. :376-385.
Vidal ME, Raschid L, Mestre J.  2004.  Challenges in selecting paths for navigational queries: Trade-off of benefit of path versus cost of plan. Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004. :61-66.
Burnett S, Feamster N, Vempala S.  2010.  Circumventing censorship with collage. Proceedings of the ACM SIGCOMM 2010 conference. :471-472.
Vaswani N, Chellappa R.  2004.  Classification probability analysis of principal component space analysis. Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on. 1:240-243Vol.1-240-243Vol.1.
Varna AL, He S, Swaminathan A, M. Wu, Lu H, Lu Z.  2007.  Collusion-Resistant Fingerprinting for Compressed Multimedia Signals. Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on. 2:II-165-II-168-II-165-II-168.
Siddiquie B, Vitaladevuni SN, Davis LS.  2009.  Combining multiple kernels for efficient image classification. Applications of Computer Vision (WACV), 2009 Workshop on. :1-8.
Cormode G, Paterson M, Sahinalp S C, Vishkin U.  2000.  Communication complexity of document exchange. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. :197-206.
Shen CC, Kupershtok R, Yang B, Vanin FM, Shao X, Sheth D, Goldsman N, Balzano Q, Bhattacharyya SS.  2007.  Compact, low power wireless sensor network system for line crossing recognition. Circuits and Systems, 2007. ISCAS 2007. IEEE International Symposium on. :2506-2509.
Berthier R, Korman D, Cukier M, Hiltunen M, Vesonder G, Sheleheda D.  2008.  On the Comparison of Network Attack Datasets: An Empirical Analysis. :39-48.
Chandra AK, Stockmeyer LJ, Vishkin U.  1982.  A complexity theory for unbounded fan-in parallelism. 23rd Annual Symposium on Foundations of Computer Science. :1-13.
Swaminathan A, Mao Y, Su G-M, Gou H, Varna AL, He S, M. Wu, Oard D.  2007.  Confidentiality-preserving rank-ordered search. Proceedings of the 2007 ACM workshop on Storage security and survivability. :7-12.
El-Sana J, Varshney A.  1997.  Controlled simplification of genus for polygonal models. Visualization '97., Proceedings. :403-410.
Matias Y, Vishkin U.  1991.  Converting high probability into nearly-constant time—with applications to parallel hashing. Proceedings of the twenty-third annual ACM symposium on Theory of computing. :307-316.
Mihaila G, Naumann F, Raschid L, Vidal ME.  2005.  A data model and query language to explore enhanced links and paths in life science sources. Proceedings of the ACM SIGMOD Workshop on The Web and Databases (WebDB).
Van Horn D, Mairson HG.  2008.  Deciding kCFA is Complete for EXPTIME. ICFP '08 Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming. :275-282.

Pages