Publications

Export 566 results:
Author Title [ Type(Desc)] Year
Filters: First Letter Of Last Name is V  [Clear All Filters]
Journal Articles
Mihaila GA, Raschid L, Vidal ME.  2001.  Source Selection and Ranking in the WebSemantics Architecture Using Quality of Data Metadata-1 Introduction. Advances in Computers. 55:89-90.
Arya S, Mount D, Vigneron A, Xia J.  2008.  Space-time tradeoffs for proximity searching in doubling spaces. Algorithms-ESA 2008. :112-123.
Srivastava A, Damon JN, Dryden IL, Jermyn IH, Das S, Vaswani N, Huckemann S, Hotz T, Munk A, Lin Z et al..  2010.  SPECIAL SECTION ON SHAPE ANALYSIS AND ITS APPLICATIONS IN IMAGE UNDERSTANDING. IEEE Transactions on Pattern Analysis and Machine Intelligence. 32(4):0162-8828.
Jategaonkar Jagadeesan L, Porter A, Puchol C, Ramming JC, Votta LG.  1998.  Specification-based Testing of Reactive Software: A Case Study in Technology Transfer. Journal of Systems and Software. 40(3):249-262.
Patro R, Dickerson JP, Bista S, Gupta SK, Varshney A.  2012.  Speeding Up Particle Trajectory Simulations under Moving Force Fields using GPUs. Journal of Computing and Information Science in Engineering.
Chen B, Kaufman A, Mueller K, Varshney A.  2002.  State of the art in data representation for visualization. IEEE Visualization Tutorial.
Turaga P, Veeraraghavan A, Srivastava A, Chellappa R.  2011.  Statistical Computations on Grassmann and Stiefel Manifolds for Image and Video-Based Recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence. 33(11):2273-2286.
Kalaiah A, Varshney A.  2005.  Statistical geometry representation for efficient transmission and rendering. ACM Transactions on Graphics. 24(2):348-373.
Clement T, Plaisant C, Vuillemot R.  2009.  The Story of One: Humanity scholarship with visualization and text analysis. Relation. 10(1.43):8485-8485.
Varadan R, Assfalg M, Raasi S, Pickart C, Fushman D.  2005.  Structural Determinants for Selective Recognition of a Lys48-Linked Polyubiquitin Chain by a UBA Domain. Molecular Cell. 18(6):687-698.
Vishkin U.  1991.  Structural parallel algorithmics. Automata, Languages and Programming. :363-380.
Varadan R, Walker O, Pickart C, Fushman D.  2002.  Structural Properties of Polyubiquitin Chains in Solution. Journal of Molecular Biology. 324(4):637-647.
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.
Konieczny A, Voytas DF, Cummings MP, Ausubel FM.  1991.  A superfamily of ıt Arabidopsis thaliana retrotransposons. Genetics. 127(4):801-809.
Van Horn D, Might M.  2011.  Systematic Abstraction of Abstract Machines. arXiv:1107.3539 [cs].
Vishkin U.  1995.  On a Technique for Parsing a String (Invited Lecture). Lecture Notes in Computer Science. 937:386-386.
Vishkin U.  2007.  Thinking in parallel: Some basic data-parallel algorithms and techniques. UMIACS, University of Maryland, College Park. 1993
Azar Y, Vishkin U.  1987.  Tight comparison bounds on the complexity of parallel sorting. SIAM J. Comput.. 16(3):458-464.
Berkman O, JaJa JF, Krishnamurthy S, Thurimella R, Vishkin U.  1994.  Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima. SIAM Journal on Computing. 23(3):449-465.
El-Sana J, Varshney A.  1998.  Topology simplification for polygonal virtual environments. Visualization and Computer Graphics, IEEE Transactions on. 4(2):133-144.
Voss C, Dorr BJ.  1995.  Toward a lexicalized grammar for interlinguas. Machine Translation. 10(1):143-184.
Vishkin U.  2008.  Toward Realizing a PRAM-on-a-Chip Vision. Lecture Notes in Computer Science. 4854:5-6.
Naishlos D, Nuzman J, Tseng CW, Vishkin U.  2003.  Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. Theory of Computing Systems. 36(5):521-552.
Mansour Y, Nisan N, Vishkin U.  1999.  Trade-offs between communication throughput and parallel time. Journal of Complexity. 15(1):148-166.
Valancius V, Kim H, Feamster N.  2010.  Transit portal: BGP connectivity as a service. ACM SIGCOMM Computer Communication Review. 40(4):463-464.

Pages