Publications

Search
Export 566 results:
Author [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is V  [Clear All Filters]
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 
E
Votta LG, Porter A, Perry D.  1995.  Experimental software engineering: A report on the state of the art. INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING. 17:277-277.
Hochstein L, Nakamura T, Basili VR, Asgari S, Zelkowitz MV, Hollingsworth J, Shull F, Carver J, Voelp M, Zazworka N et al..  2006.  Experiments to understand HPC time to development. CTWatch Quarterly.
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.
Vishkin D, Vishkin U.  2000.  Experiments with list ranking for explicit multi-threaded (XMT) instruction parallelism. J. Exp. Algorithmics. 5
Vishkin U, Dascal S, Berkovich E, Nuzman J.  1998.  Explicit Multi-Threading (XMT) bridging models for instruction parallelism (extended abstract). Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures. :140-151.
Lacroix Z, Moths T, Parekh K, Raschid L, Vidal M-E.  2004.  Exploiting multiple paths to express scientific queries. 16th International Conference on Scientific and Statistical Database Management, 2004. Proceedings. :357-360.
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.
Baker P, Pless R, Fermüller C, Aloimonos Y.  2001.  Eyes from Eyes. 3D Structure from Images — SMILE 20003D Structure from Images — SMILE 2000. 2018:204-217.
F
Might M, Van Horn D.  2011.  A family of abstract interpretations for static analysis of concurrent higher-order programs. arXiv:1103.5167 [cs].
Landau GM, Vishkin U, Nussinov R.  1990.  Fast alignment of DNA and protein sequences. Methods in enzymology. 183:487-502.
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.
Varshney A, Brooks FP.  1993.  Fast analytical computation of Richards's smooth molecular surface. Proceedings of the 4th conference on Visualization '93. :300-307.
Ramachandran M, Veeraraghavan A, Chellappa R.  2007.  Fast Bilinear SfM with Side Information. Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on. :1-8.
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.
Liu M-Y, Tuzel O, Veeraraghavan A, Chellappa R.  2010.  Fast directional chamfer matching. Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on. :1696-1703.
Sankaranarayanan J, Samet H, Varshney A.  2006.  A Fast k-Neighborhood Algorithm for Large Point-Clouds. Proceedings of the 3rd IEEE/Eurographics Symposium on Point-Based Graphics. ACM, Boston, MA, USA.
Ramachandran A, Seetharaman S, Feamster N, Vazirani V.  2008.  Fast monitoring of traffic subpopulations. Proceedings of the 8th ACM SIGCOMM conference on Internet measurement. :257-270.
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.
Landau GM, Vishkin U.  1989.  Fast parallel and serial approximate string matching* 1. Journal of Algorithms. 10(2):157-169.
Landau GM, Vishkin U.  1988.  Fast string matching with k differences.. J. COMP. SYST. SCI.. 37(1):63-78.
Landau GM, Vishkin U.  1988.  Fast string matching with k differences* 1,* 2. Journal of Computer and System Sciences. 37(1):63-78.
Cole R, Vishkin U.  1989.  Faster optimal parallel prefix sums and list ranking. Information and Computation. 81(3):334-352.
Ramachandran A, Feamster N, Vempala S.  2007.  Filtering spam with behavioral blacklisting. Proceedings of the 14th ACM conference on Computer and communications security. :342-351.
Megiddo N, Vishkin U.  1988.  On finding a minimum dominating set in a tournament. Theoretical Computer Science. 61(2-3):307-316.

Pages