Publications

Search
Export 136 results:
[ Author(Asc)] Title 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 
V
Vutukuru M, Feamster N, Walfish M, Balakrishnan H, Shenker S.  2006.  Revisiting Internet addressing: Back to the future. MIT-CSAIL-TR-2006-025
Vuillemot R, Clement T, Plaisant C, Kumar A.  2009.  What's being said near "Martha"? Exploring name entities in literary text collections Visual Analytics Science and Technology, 2009. VAST 2009. IEEE Symposium on. :107-114.
Voytas DF, Konieczny A, Cummings MP, Ausubel FM.  1990.  The structure, distribution and evolution of the ıt Ta1 retrotransposable element family of ıt Arabidopsis thaliana. Genetics. 126(3):713-721.
Voytas DF, Cummings MP, Koniczny A, Ausubel FM, Rodermel SR.  1992.  copia-like retrotransposons are ubiquitous among plants. Proc Natl Acad Sci USA. 89(15):7124-7128.
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.
Voss C, Dorr BJ.  1995.  Toward a lexicalized grammar for interlinguas. Machine Translation. 10(1):143-184.
Voss CR, Dorr BJ, Sencan MU.  1995.  Lexical allocation in interlingua-based machine translation of spatial expressions. Working Notes for IJCAI-95 Workshop on the Representation and Processing of Spatial Expressions, Montreal, Canada.
Von Matt U, Stewart G.W.  1998.  Rounding Errors in Solving Block Hessenberg Systems. UMIACS-TR-94-105
Von Matt U, Stewart G.W.  1996.  Rounding errors in solving block Hessenberg systems. Mathematics of Computation. 65(213):115-135.
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.
Vogtmann DE, Gupta SK, Bergbreiter S.  2011.  Multi-material compliant mechanisms for mobile millirobots. :3169-3174.
Vitali M, De Floriani L, Magillo P.  2011.  Computing morse decompositions for triangulated terrains: an analysis and an experimental evaluation. Image Analysis and Processing–ICIAP 2011. :565-574.
Vitaladevuni SN, Kellokumpu V, Davis LS.  2008.  Action recognition using ballistic dynamics. Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on. :1-8.
Vishnoi A, Sethupathy P, Simola D, Plotkin JB, Hannenhalli S.  2011.  Genome-Wide Survey of Natural Selection on Functional, Structural, and Network Properties of Polymorphic Sites in Saccharomyces Paradoxus. Molecular Biology and EvolutionMol Biol Evol. 28(9):2615-2627.
Vishnoi A, Kryazhimskiy S, Bazykin GA, Hannenhalli S, Plotkin JB.  2010.  Young Proteins Experience More Variable Selection Pressures Than Old Proteins. Genome ResearchGenome Res.. 20(11):1574-1581.
Vishkin U.  1995.  On a technique for parsing a string. Combinatorial Pattern Matching. :386-386.
Vishkin U.  2010.  Computer Memory Architecture for Hybrid Serial and Parallel Computing Systems. 12/721,252
Vishkin U.  1991.  Structural parallel algorithmics. Automata, Languages and Programming. :363-380.
Vishkin U.  1984.  Randomized speed-ups in parallel computation. Proceedings of the sixteenth annual ACM symposium on Theory of computing. :230-239.
Vishkin U.  2007.  Thinking in parallel: Some basic data-parallel algorithms and techniques. UMIACS, University of Maryland, College Park. 1993
Vishkin U.  2000.  A no-busy-wait balanced tree parallel algorithmic paradigm. Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures. :147-155.
Vishkin U.  1992.  A parallel blocking flow algorithm for acyclic networks. Journal of Algorithms. 13(3):489-501.
Vishkin U.  1987.  Randomized parallel speedups for list ranking* 1. Journal of Parallel and Distributed Computing. 4(3):319-333.
Vishkin U.  2008.  An Immediate Concurrent Execution (ICE) Abstraction Proposal for Many-Cores. Computer Science Research Works.
Vishkin U.  1983.  Implementation of simultaneous memory address access in models that forbid it. Journal of algorithms. 4(1):45-50.

Pages