Publications

Export 7151 results:
Author Title [ Type(Desc)] Year
Filters: Block-preconditioners-discrete-incompressible-navier%E2%80%93stokes-equations is   [Clear All Filters]
Journal Articles
Zhou S, Krueger V, Chellappa R.  2003.  Probabilistic recognition of human faces from video. Computer Vision and Image Understanding. 91(1–2):214-245.
Philippou A, Cleaveland R, Lee I, Smolka S, Sokolsky O.  1998.  Probabilistic resource failure in real-time process algebra. CONCUR'98 Concurrency Theory. :465-472.
Bröcheler M, Mihalkova L, Getoor L.  2010.  Probabilistic similarity logic. Proceedings of the Conference on Uncertainty in Artificial Intelligence.
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.
Cleaveland R, Iyer PS, Narasimha M.  2005.  Probabilistic temporal logics via the modal mu-calculus. Theoretical Computer Science. 342(2-3):316-350.
Chou HH, Reggia JA.  1998.  Problem solving during artificial selection of self-replicating loops* 1. Physica D: Nonlinear Phenomena. 115(3-4):293-312.
Zellner ML, Riolo RL, Rand W, Brown DG, Page SE, Fernandez LE.  2010.  The problem with zoning: nonlinear effects of interactions between location preferences and externalities on land use and utility. Environment and Planning B: Planning and Design. 37(3):408-428.
Cleaveland R, L\üttgen G, Natarajan V.  1996.  A process algebra with distributed priorities. CONCUR'96: Concurrency Theory. :34-49.
Stark EW, Cleaveland R, Smolka SA.  2003.  A process-algebraic language for probabilistic I/O automata. CONCUR 2003-Concurrency Theory. :193-207.
Deligiannakis A, Kotidis Y, Roussopoulos N.  2006.  Processing approximate aggregate queries in wireless sensor networks. Information Systems. 31(8):770-792.
Beynon M, Chang C, Catalyurek U, Kurc T, Sussman A, Andrade H, Ferreira R, Saltz J.  2002.  Processing large-scale multi-dimensional data in parallel and distributed environments. Parallel Computing. 28(5):827-859.
Yegnanarayana B, Prasanna SRM, Duraiswami R, Zotkin DN.  2005.  Processing of reverberant speech for time-delay estimation. IEEE Transactions on Speech and Audio Processing. 13(6):1110-1118.
Khuller S, Mitchell SG, Vazirani VV.  1992.  Processor efficient parallel algorithms for the two disjoint paths problem and for finding a Kuratowski homeomorph. SIAM Journal on Computing. 21:486-486.
Chang YH, Raschid L.  2000.  Producing Interoperable Queries for Relational and Object-Oriented Databases. Journal of Intelligent Information Systems. 14(1):51-75.
Zelkowitz MV.  1978.  Productivity measurement on software engineering projects. SIGSOFT Softw. Eng. Notes. 3(4):30-31.
Furr M, An JD, Foster JS.  2009.  Profile-guided static typing for dynamic scripting languages. ACM SIGPLAN Notices. 44(10):283-300.
Bail WG, Zelkowitz MV.  1988.  Program complexity using Hierarchical Abstract Computers. Computer Languages. 13(3–4):109-123.
Miara RJ, Musselman JA, Navarro JA, Shneiderman B.  1983.  Program indentation and comprehensibility. Communications of the ACM. 26(11):861-867.
Balkan AO, Vishkin U.  2006.  Programmer's Manual for XMTC Language, XMTC Compiler and XMT Simulator. Technical Reports from UMIACS, UMIACS-TR-2005-45.
Zelkowitz MV.  2001.  Programming languages: designing and implementation. BeOing: Electronic Industry Press. 6:46-65.
Cable JH, Ordonez JF, Chintalapani G, Plaisant C.  2004.  Project portfolio earned value management using treemaps. Proceedings of the Project Management Institute Research Conference.
Basri R, Jacobs DW.  2001.  Projective alignment with regions. Pattern Analysis and Machine Intelligence, IEEE Transactions on. 23(5):519-527.
Roitman H, Gal A, Raschid L.  2006.  ProMo-A Scalable and Efficient Framework for Online Data Delivery. Lecture notes in computer science. 4032:359-359.

Pages