Publications

Export 564 results:
Author Title Type [ Year(Desc)]
Filters: First Letter Of Title is E  [Clear All Filters]
2001
Mount D, Netanyahu NS.  2001.  Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. Computational Geometry. 19(1):1-33.
Deshpande A, Garofalakis MN, Jordan MI.  2001.  Efficient stepwise selection in decomposable models. Proc. UAI. :128-135.
Borovikov E, Sussman A, Davis LS.  2001.  An efficient system for multi-perspective imaging and volumetric shape analysis. Proceedings of the 2001 Workshop on Parallel and Distributed Computing in Imaging Processing, Video Processing, and Multimedia.
Stewart G.W.  2001.  On the eigensystems of graded matrices. Numerische Mathematik. 90(2):349-370.
Maneewongvatana S, Mount D.  2001.  An empirical study of a new approach to nearest neighbor searching. Algorithm Engineering and Experimentation. :172-187.
Graves TL, Harrold M J, Kim J-M, Porter A, Rothermel G.  2001.  An empirical study of regression test selection techniques. ACM Transactions on Software Engineering and MethodologyACM Trans. Softw. Eng. Methodol.. 10(2):184-208.
Konishi M, Plaisant C, Shneiderman B.  2001.  Enabling Commuters to Find the Best Route: An Interface for Analyzing Driving History Logs. Proceedings of the IFIP Conference on Human-Computer Interaction (Interact2001). :799-800.
Levy S, Hannenhalli S, Workman C.  2001.  Enrichment of Regulatory Signals in Conserved Non-Coding Genomic Sequence. BioinformaticsBioinformatics. 17(10):871-877.
Arya S, Malamatos T, Mount D.  2001.  Entropy-preserving cuttings and space-efficient planar point location. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :256-261.
Cleaveland R, Sokolsky O.  2001.  Equivalence and preorder checking for finite-state systems. Handbook of Process Algebra. :391-424.
Marchionini G, Hert C, Shneiderman B, Liddy L.  2001.  E-tables: Non-specialist use and understanding of statistical data. SURFACE, the Syracuse University Research Facility And Collaborative Environment. :33-33.
Naishlos D, Nuzman J, Tseng CW, Vishkin U.  2001.  Evaluating the XMT parallel programming model. High-Level Parallel Programming Models and Supportive Environments. :95-108.
Ayers D, Reggia JA.  2001.  Evolving columnar circuitry for lateral cortical inhibition. Neural Networks, 2001. Proceedings. IJCNN'01. International Joint Conference on. 1:278-283.
Basili VR, Costa P, Lindvall M, Mendonca M, Seaman C, Tesoriero R, Zelkowitz MV.  2001.  An experience management system for a software engineering research organization. Software Engineering Workshop, 2001. Proceedings. 26th Annual NASA Goddard. :29-35.
Barrett C, Cook D, Hicks G, Faber V, Marathe A, Marathe M, Srinivasan A, Sussmann Y, Thornquist H.  2001.  Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry. Algorithm EngineeringAlgorithm Engineering. 2141:172-184.
Tanin E, Shneiderman B.  2001.  Exploration of Large Online Data Tables Using Generalized Query Previews. University of Maryland Computer Science Technical Report (June 2001).
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.
Neumann J, Fermüller C, Aloimonos Y, for University of Maryland(College Park M.). C A R.  2001.  Eyes from Eyes: Analysis of Camera Design Using Plenoptic Video Geometry.
2002
Shevtsova N, Reggia JA.  2002.  Effects of callosal lesions in a model of letter perception. Cognitive, Affective, & Behavioral Neuroscience. 2(1):37-37.
Lipp EK, Huq A, Colwell RR.  2002.  Effects of Global Climate on Infectious Disease: The Cholera Model. Clinical Microbiology ReviewsClin. Microbiol. Rev.. 15(4):757-770.
Katz J.  2002.  Efficient Cryptographic Protocols Preventing “Man-in-the-Middle” Attacks.
Banerjee S, Agrawala AK, Kramer MJ.  2002.  Efficient Data Processing using Cross Layer Hints. Technical Reports from UMIACS, UMIACS-TR-2002-59.
Tikir MM, Hollingsworth J.  2002.  Efficient instrumentation for code coverage testing. ACM SIGSOFT Software Engineering Notes. 27:86-96.
Kanungo T, Mount D, Netanyahu NS, Piatko CD, Silverman R, Wu AY.  2002.  An efficient k-means clustering algorithm: analysis and implementation. Pattern Analysis and Machine Intelligence, IEEE Transactions on. 24(7):881-892.
Beynon MD, Sussman A, Kurc T, Catalyurek U, Saltz J.  2002.  Efficient Manipulation of Large Datasets on Heterogeneous Storage Systems. Parallel and Distributed Processing Symposium, International. 2:0084-0084.

Pages