Publications

Export 3364 results:
Author Title Type [ Year(Desc)]
Filters: First Letter Of Last Name is S  [Clear All Filters]
2000
Caprara A, Italiano G, Mohan G, Panconesi A, Srinivasan A.  2000.  Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem. Approximation Algorithms for Combinatorial Optimization. 1913:71-84.
Mareboyana M, Srivastava S, JaJa JF.  2000.  Web based progressive transmission for browsing remotely sensed imagery. Geoscience and Remote Sensing Symposium, 2000. Proceedings. IGARSS 2000. IEEE 2000 International. 2:591-593vol.2-591-593vol.2.
2001
Ren Y, Cukier M, Sanders WH.  2001.  An adaptive algorithm for tolerating value faults and crash failures. Parallel and Distributed Systems, IEEE Transactions on. 12(2):173-192.
Stewart G.W.  2001.  Adjusting the Rayleigh Quotient in Semiorthogonal Lanczos Methods. UMIACS-TR-2001-31
Mount D, Kanungo T, Netanyahu NS, Piatko C, Silverman R, Wu AY.  2001.  Approximating large convolutions in digital images. Image Processing, IEEE Transactions on. 10(12):1826-1835.
Gandhi R, Khuller S, Srinivasan A.  2001.  Approximation algorithms for partial covering problems. Automata, Languages and Programming. :225-236.
Sinha K, Candler GV, Martin, M.P.  2001.  Assessment of the k-epsilon turbulence model for compressible flows using direct simulation data. 39th AIAA Aerospace Sciences Meeting and Exhibit.
Sims S, Cleaveland R, Butts K, Ranville S.  2001.  Automated Validation of Software Models. Automated Software Engineering, International Conference on. :91-91.
Stewart G.W.  2001.  Backward Error Bounds for Approximate Krylov Subspaces. UMIACS-TR-2001-32
Duderstadt J, Arms W, Messina P, Ellisman M, Atkins D, Fox E, Shneiderman B, Nissenbaum H, Lederberg J.  2001.  Becoming a Scholar in the Digital Age.
Goldberg L A, Paterson M, Srinivasan A, Sweedyk E.  2001.  Better Approximation Guarantees for Job-Shop Scheduling. SIAM Journal on Discrete Mathematics. 14(1):67-67.
Goldberg L A, Paterson M, Srinivasan A, Sweedyk E.  2001.  Better Approximation Guarantees for Job-Shop Scheduling. SIAM Journal on Discrete Mathematics. 14(1):67-67.
Basili VR, Tesoriero R, Costa P, Lindvall M, Rus I, Shull F, Zelkowitz MV.  2001.  Building an Experience Base for Software Engineering: A report on the first CeBASE eWorkshop. Product Focused Software Process Improvement. :110-125.
North C, Shneiderman B.  2001.  Component-based, user-constructed, multiple-view visualization. CHI '01 extended abstracts on Human factors in computing systems. :201-202.
Reggia JA, Schulz R, Wilkinson GS, Uriagereka J.  2001.  Conditions enabling the emergence of inter-agent signalling in an artificial world. Artificial Life. 7(1):3-32.
Memon AM, Soffa M L, Pollack ME.  2001.  Coverage criteria for GUI testing. Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering. :256-267.
Shneiderman B.  2001.  Design: CUU: bridging the digital divide with universal usability. Interactions. 8(2):11-15.
Bhattacharjee B, Keleher P, Silaghi B.  2001.  The Design of TerraDir. Technical Reports from UMIACS, UMIACS-TR-2001-4299.
Shankar U, Talwar K, Foster JS, Wagner D.  2001.  Detecting format string vulnerabilities with type qualifiers. Proceedings of the 10th conference on USENIX Security Symposium-Volume 10. :16-16.
Shneiderman B.  2001.  The Digital University: Building a Learning Community.
Spencer JH, Srinivasan A, Tetali P.  2001.  The discrepancy of permutation families. Unpublished manuscript.
Spencer JH, Srinivasan A, Tetali P.  2001.  The discrepancy of permutation families. Unpublished manuscript.
Beynon MD, Kurc T, Catalyurek U, Chang C, Sussman A, Saltz J.  2001.  Distributed processing of very large datasets with DataCutter. Parallel Computing. 27(11):1457-1478.
Beynon MD, Kurc T, Catalyurek U, Chang C, Sussman A, Saltz J.  2001.  Distributed processing of very large datasets with DataCutter. Parallel Computing. 27(11):1457-1478.
Srinivasan A.  2001.  Distributions on level-sets with applications to approximation algorithms. 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings. :588-597.

Pages