Publications

Export 566 results:
Author Title [ Type(Asc)] Year
Filters: First Letter Of Last Name is V  [Clear All Filters]
Journal Articles
El‐Sana J, Varshney A.  1999.  Generalized View‐Dependent Simplification. Computer Graphics Forum. 18(3):83-94.
Turaga PK, Veeraraghavan A, Chellappa R.  2008.  From Videos to Verbs: Mining Videos for Activities using a cascade of dynamical systems (Supplemental Material). Relation. 10(1.13):9944-9944.
Tobin-Hochstadt S, Van Horn D.  2013.  From Principles to Practice with Class in the First Year. arXiv:1306.4713 [cs].
Varna AL, Chuang WH, Wu M.  2010.  A framework for theoretical analysis of content fingerprinting. Proc. of SPIE Media Forensics and Security.
Lu W, Varna AL, Wu M.  2010.  Forensic hash for multimedia information. SPIE Media Forensics and Security. :7541–0Y-7541–0Y.
Balog K, de Vries AP, Serdyukov P, Wen J-R.  2012.  The first international workshop on entity-oriented search (EOS). SIGIR Forum. 45(2):43-50.
Varna AL, He S, Swaminathan A, M. Wu.  2009.  Fingerprinting Compressed Multimedia Signals. Information Forensics and Security, IEEE Transactions on. 4(3):330-345.
Shiloach Y, Vishkin U.  1981.  Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms. 2(1):88-102.
Berkman O, Vishkin U.  1994.  Finding level-ancestors in trees. Journal of Computer and System Sciences. 48(2):214-230.
Atallah M, Vishkin U.  1984.  Finding Euler tours in parallel* 1. Journal of Computer and System Sciences. 29(3):330-337.
Schieber B, Vishkin U.  1990.  Finding all nearest neighbors for convex polygons in parallel: a new lower bound technique and a matching algorithm. Discrete Applied Mathematics. 29(1):97-111.
Megiddo N, Vishkin U.  1988.  On finding a minimum dominating set in a tournament. Theoretical Computer Science. 61(2-3):307-316.
Cole R, Vishkin U.  1989.  Faster optimal parallel prefix sums and list ranking. Information and Computation. 81(3):334-352.
Landau GM, Vishkin U.  1988.  Fast string matching with k differences* 1,* 2. Journal of Computer and System Sciences. 37(1):63-78.
Landau GM, Vishkin U.  1988.  Fast string matching with k differences.. J. COMP. SYST. SCI.. 37(1):63-78.
Landau GM, Vishkin U.  1989.  Fast parallel and serial approximate string matching* 1. Journal of Algorithms. 10(2):157-169.
Berkman O, Schieber B, Vishkin U.  1996.  A fast parallel algorithm for finding the convex hull of a sorted point set. International Journal of Computational Geometry and Applications. 6:231-242.
Ramachandran M, Veeraraghavan A, Chellappa R.  2011.  A Fast Bilinear Structure from Motion Algorithm Using a Video Sequence and Inertial Sensors. IEEE Transactions on Pattern Analysis and Machine Intelligence. 33(1):186-193.
Sankaranarayanan J, Samet H, Varshney A.  2007.  A fast all nearest neighbor algorithm for applications involving large point-clouds. Computers & Graphics. 31(2):157-174.
Landau GM, Vishkin U, Nussinov R.  1990.  Fast alignment of DNA and protein sequences. Methods in enzymology. 183:487-502.
Might M, Van Horn D.  2011.  A family of abstract interpretations for static analysis of concurrent higher-order programs. arXiv:1103.5167 [cs].
Tse T, Vegh S, Shneiderman B, Marchionini G.  1999.  An Exploratory Study of Video Browsing, User Interface Designs and Research Methodologies: Effectiveness in Information Seeking Tasks. PROCEEDINGS OF THE ANNUAL MEETING-AMERICAN SOCIETY FOR INFORMATION SCIENCE. 36:681-692.
Vishkin D, Vishkin U.  2000.  Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism. J. Exp. Algorithmics. 5
Vishkin D, Vishkin U.  2000.  Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism. J. Exp. Algorithmics. 5
Dascal S, Vishkin U.  1999.  Experiments with list ranking for Explicit Multi-Threaded (XMT) instruction parallelism. Algorithm Engineering. :43-59.

Pages