Reports

(Publications are listed alphabetically by title)

Pages

Perlis D, Anderson M. Metareasoning for More Effective Human-Computer Dialogue. University of Maryland, College Park; 2002.
Mount D, Silverman R. Minimum Enclosures with Specified Angles. Vol CS-TR-3219. Department of Computer Science, University of Maryland, College Park; 1998.
Ackermann C, Ray A, Cleaveland R, Heit J, Martin C, Shelton C. Model Based Design Verification: A Monitor Based Approach. Vol 2008-01-0741. Warrendale, PA: SAE International; 2008.
Agrawala AK, Sanghi D. Modeling of cross traffic in conjunction with deterministic analysis of queues. College Park, MD, USA: University of Maryland at College Park; 1991.
Juba D, Varshney A. Modelling and rendering large volume data with gaussian radial basis functions. Vol UMIACS-TR-2007-22. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 2007.
Vishkin U, Caragea GC, Lee B. Models for Advancing PRAM and Other Algorithms into Parallel Programs for a PRAM-On-Chip Platform.; 2006.
Kustanowitz J, Shneiderman B. Motivating annotation for digital photographs: Lowering barriers while raising incentives.; 2004.
Tariq MB, Motiwala M, Feamster N. NANO: Network Access Neutrality Observatory. Vol GT-CS-08-03. Georgia Institute of Technology; 2008.
Atallah GC, Ball MO, Baras JS, Goli SK, Karne RK, Kelley S, et al. Next Generation Network Management Technology.; 1994.
JaJa JF. NSF Workshop Storage Resource Broker Data Grid Preservation Assessment. Vol TR-2006.3. San Diego Supercomputer Center; 2006.
Stewart G.. On an Inexpensive Triangular Approximation to the Singular Value Decomposition. Vol UMIACS-TR-97-75. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 1998.
Kang H, Roussopoulos N. On Cost-effectiveness of a Semijoin in Distributed Query Processing.. Vol ISR-TR-1987-38. Institute for Systems Research, University of Maryland, College Park; 1987.
Mount D. On Finding Shortest Paths on Convex Polyhedra.. CENTER FOR AUTOMATION RESEARCH, UNIVERSITY OF MARYLAND COLLEGE PARK; 1985.
Schroeder E, Stewart G.. On Infinitely Many Algorithms for Solving Equations. Vol UMIACS-TR-92-121. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 1998.
Stewart G.. On Orthogonalization in the Inverse Power Method. Vol UMIACS-TR-99-64. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 1999.
Stewart G.. On Sublinear Convergence. Vol UMIACS-TR-95-92. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 1998.
Mount D, Silverman R, Wu AY. On the Area of Overlap of Translated Polygons. Vol CS-TR-3201. Department of Computer Science, University of Maryland, College Park; 1998.
Fermüller C, Aloimonos Y. On the geometry of visual correspondence.; 1998.
Stewart G.. On the Perturbation of LU, Cholesky, and QR Factorizations. Vol UMIACS-TR-92-24. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 1998.
Stewart G.. On the perturbation of Schur complement in positive semidefinite matrix. Vol TR-95-38. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 1995.
Khuller S, Mitchell SG, Vazirani VV. On-line algorithms for weighted matching and stable marriages. Vol TR90-1143. Cornell University; 1990.
Chakrabarti C, JaJa JF. Optimal Architectures for Multidimensional Transforms. Vol ISR-TR-1988-39. Institute for Systems Research, University of Maryland, College Park; 1988.
Chang SC, JaJa JF, Ryu KW. Optimal parallel algorithms for one-layer routing. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 1989.
Chakrabarti C, JaJa JF. Optimal Systolic Designs for the Computation of the Discrete Hartley and the Discrete Cosine Transforms. Institute for Systems Research, University of Maryland, College Park; 1988.
V.S. Subrahmanian. Optimizing Heavily Loaded Agents. Department of Computer Science, University of Maryland, College Park; 2003.
Bederson BB, Shneiderman B, Wattenberg M. Ordered and Quantum Treemaps: Making Effective Use of 2D Space to Display Hierarchies (2001).; 2005.
Elaine Shi, Stoica I, Andersen DG, Perrig A. OverDoSe: A generic DDoS protection service using an overlay network. School of Computer Science, Carnegie Mellon University; 2006.
Ramachandran A, Bhandankar K, Tariq MB, Feamster N. Packets with provenance. Vol GT-CS-08-02. Georgia Institute of Technology; 2008.
Okun O, Doermann D, Pietikainen M. Page Segmentation and Zone Classification: The State of the Art. Vol LAMP-TR-036,CAR-TR-927,CS-TR-4079. University of Maryland, College Park; 1999.
Bader DA, JaJa JF. Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study. Vol UMIACS-TR-94-133. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 1998.
JaJa JF, Shi Q, Varshney A. Parallel Algorithms for Volumetric Surface Construction. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 2008.
Chang S-, JaJa JF. Parallel Algorithms for Wiring Module Pins to Frame Pads. Institute for Systems Research, University of Maryland, College Park; 1988.
Varshney A. Parallel radiosity techniques for mesh-connected SIMD computers. NORTH CAROLINA UNIV AT CHAPEL HILL DEPT OF COMPUTER SCIENCE: DTIC Document; 1991.
Smorul M, JaJa JF, Wang Y, McCall F. PAWN: Producer-Archive Workflow Network in support of digital preservation. Vol UMIACS-TR-2004. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 2004.
Fermüller C. Perception of 3D Motion through Patterns of Visual Motion.. CENTER FOR AUTOMATION RESEARCH, UNIVERSITY OF MARYLAND COLLEGE PARK; 1995.
Stewart G.. Perturbation Theory for the Singular Value Decomposition. Vol UMIACS-TR-90-124. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 1998.
Broadwater J, Chellappa R. Physics-Based Detectors Applied to Long-Wave Infrared Hyperspectral Data. CENTER FOR AUTOMATION RESEARCH, UNIVERSITY OF MARYLAND COLLEGE PARK; 2006.
Hicks MW. PLAN Security System.; 1998.
Mundada Y, Ramachandran A, Tariq MB, Feamster N. Practical Data-Leak Prevention for Legacy Applications in Enterprise Networks. Vol GT-CS-11-01. Georgia Institute of Technology; 2011.
Elman H. Preconditioned Conjugate-Gradient Methods for Nonsymmetric Systems of Linear Equations.. DTIC Document; 1981.
Elman H. Preconditioners for Saddle Point Problems Arising in Computational Fluid Dynamics. Vol UMIACS-TR-2001-88. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 2001.
Licamele L, Getoor L. Predicting Protein-Protein Interactions Using Relational Features. Vol CS-TR-4909. Department of Computer Science, University of Maryland, College Park; 2007.
Dorr BJ. Principle-Based Parsing for Machine Translation. MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB; 1987.
Vishkin U. Project for Developing Computer Science Agenda(s) for High-Performance Computing: An Organizer's Summary. Vol UMIACS-TR-94-129. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 1998.
Shneiderman B. Promoting Universal Usability with Multi-Layer Interface Design (2003).; 2005.
Clark R, Feamster N, Nayak A, Reimers A. Pushing Enterprise Security Down the Network Stack. Vol GT-CS-09-03. Georgia Institute of Technology; 2009.
Stewart G.. QR Sometimes Beats Jacobi. Vol UMIACS-TR-95-32. Instititue for Advanced Computer Studies, Univ of Maryland, College Park; 1998.
Wang F, Feamster N, Gao L. Quantifying the effects of routing dynamics on end-to-end Internet path failures. Vol TR-05-CSE-03. University of Massachusetts; 2006.
Wongsuphasawat K, Plaisant C, Shneiderman B. Querying timestamped event sequences by exact search or similarity-based search: design and empirical evaluation. Vol HCIL-2009-20. Human-Computer Interaction Lab, University of Maryland; 2009.
Yang C, Duraiswami R, Elgammal A, Davis LS. Real-Time Kernel-Based Tracking in Joint Feature-Spatial Spaces.; 2004.

Pages