Publications

Fleischer L, Meyerson A, Saniee I, Shepherd FB, Srinivasan A. 2001. Near-optimal design of MP S tunnels with shared recovery. DIMACS Mini-Workshop on Quality of Service Issues in the Internet.

Srinivasan A. 2001. New approaches to covering and packing problems. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :567-576.

Li Y, Long PM, Srinivasan A. 2001. The one-inclusion graph algorithm is near-optimal for the prediction model of learning. IEEE Transactions on Information Theory. 47(3):1257-1261.

Agrawala AK. 2001. Operating Systems. Real-Time Systems.

Ozcan F, V.S. Subrahmanian, Golubchik L. 2001. Optimal Agent Selection. KI 2001: advances in artificial intelligence: Joint German/Austrian Conference on AI, Vienna, Austria, September 19-21, 2001: proceedings. :2-2.

Ben-Yashar R, Khuller S, Kraus S. 2001. Optimal collective dichotomous choice under partial order constraints. Mathematical Social Sciences. 41(3):349-364.

Eckman BA, Lacroix Z, Raschid L. 2001. Optimized seamless integration of biomolecular data. Proceedings of the IEEE 2nd International Symposium on Bioinformatics and Bioengineering Conference, 2001. :23-32.

Shneiderman B, Wattenberg M. 2001. Ordered treemap layouts. IEEE Symposium on Information Visualization, 2001. INFOVIS 2001. :73-78.

Bhattacharya B, Bhattacharyya SS. 2001. Parameterized dataflow modeling for DSP systems. Signal Processing, IEEE Transactions on. 49(10):2408-2421.

Ozcan F, V.S. Subrahmanian. 2001. Partitioning activities for agents. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 17:1218-1228.

Jacobs DW. 2001. Perceptual organization as generic object recognition. From Fragments to Objects Segmentation and Grouping in VisionFrom Fragments to Objects Segmentation and Grouping in Vision. Volume 130:295-329.

Beynon MD, Sussman A, Catalyurek U, Kurc T, Saltz J. 2001. Performance optimization for data intensive grid applications. Active Middleware Services, 2001. Third Annual International Workshop on. :97-105.

Itoi N, Arbaugh WA, Pollack S, Reeves D. 2001. Personal secure booting. Information Security and Privacy. :130-144.

Mount D, Gable CW. 2001. A point-placement strategy for conforming Delaunay tetrahedralization. International Journal of Computational Geometry & Applications. 11(6):669-682.

Moore JT, Hicks MW, Nettles S. 2001. Practical programmable packets. IEEE INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. 1:41-50vol.1-41-50vol.1.

Elman H. 2001. Preconditioners for Saddle Point Problems Arising in Computational Fluid Dynamics. UMIACS-TR-2001-88

Alexander DS, Menage PB, Keromytis AD, Arbaugh WA, Anagnostakis KG, Smith JM. 2001. The price of safety in an active network. Journal of Communications and Networks. 3(1):4-18.

Getoor L, Friedman N, Taskar B. 2001. Probabilistic models of relational structure. In Proc. ICML.

Getoor L, Segal E, Taskar B, Koller D. 2001. Probabilistic models of text and link structure for hypertext classification. IJCAI workshop on text learning: beyond supervision. :24-29.

Eiter T, Lu JJ, Lukasiewicz T, V.S. Subrahmanian. 2001. Probabilistic object bases. ACM Trans. Database Syst.. 26(3):264-312.

Alex D, Robert R, V.S. Subrahmanian. 2001. Probabilistic temporal databases. ACM Transaction on Database Systems. 26(1):41-95.

Dekhtyar A, Ross R, V.S. Subrahmanian. 2001. Probabilistic temporal databases, I: algebra. ACM Trans. Database Syst.. 26(1):41-95.

Dekhtyar A, Ozcan F, Ross R, V.S. Subrahmanian. 2001. Probabilistic Temporal Databases, II: Calculus and Query Processing. Technical Reports from UMIACS, UMIACS-TR-2001-79.

Zelkowitz MV. 2001. Programming languages: designing and implementation. BeOing: Electronic Industry Press. 6:46-65.

Basri R, Jacobs DW. 2001. Projective alignment with regions. Pattern Analysis and Machine Intelligence, IEEE Transactions on. 23(5):519-527.

Pages

Publications