Publications

Search
Export 139 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.  1996.  Rounding errors in solving block Hessenberg systems. Mathematics of Computation. 65(213):115-135.
Von Matt U, Stewart G.W.  1998.  Rounding Errors in Solving Block Hessenberg Systems. UMIACS-TR-94-105
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, 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.
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.
Vishkin U.  2009.  Optical interconnect structure in a computer system and method of transporting data between processing elements and memory through the optical interconnect structure. 10/529,310(7505822)
Vishkin U.  1987.  An optimal parallel algorithm for selection. Parallel and Distributed Computing. 4:79-86.
Vishkin U, Nuzman JF.  2004.  Circuit architecture for reduced-synchrony on-chip interconnect. 10/166,008(6768336)
Vishkin U, Wigderson A.  1983.  Dynamic parallel memories. Information and control. 56(3):174-182.
Vishkin U.  1997.  From algorithm parallelism to instruction-level parallelism: An encode-decode chain using prefix-sum. Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures. :260-271.
Vishkin U.  1992.  Methods in parallel algorithmcs. Mathematical Foundations of Computer Science 1992. :81-81.
Vishkin U, Smolyaninov I, Davis C.  2007.  Plasmonics and the parallel programming problem. Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series. 6477:19-19.
Vishkin U.  1984.  A parallel-design distributed-implementation (PDDI) general-purpose computer. Theoretical Computer Science. 32(1-2):157-172.
Vishkin U.  1998.  Project for Developing Computer Science Agenda(s) for High-Performance Computing: An Organizer's Summary. UMIACS-TR-94-129
Vishkin U.  2002.  Two techniques for reconciling algorithm parallelism with memory constraints. Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures. :95-98.

Pages