Publications

Export 7148 results:
[ Author(Asc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
D
Deshpande A, Ives Z, Raman V.  2007.  Adaptive query processing: why, how, when, what next? Proceedings of the 33rd international conference on Very large data bases. :1426-1427.
Deshpande A, Guestrin C, Madden SR, Hellerstein JM, Hong W.  2004.  Model-driven data acquisition in sensor networks. Proceedings of the Thirtieth international conference on Very large data bases - Volume 30. :588-599.
Deshpande A, Sarawagi S.  2007.  Probabilistic graphical models and their role in databases. Proceedings of the 33rd international conference on Very large data bases. :1435-1436.
Deshpande A, Hellerstein JM.  2002.  Decoupled query optimization for federated database systems. 18th International Conference on Data Engineering, 2002. Proceedings. :716-727.
Deshpande A, Khuller S, Malekian A, Toossi M.  2011.  Energy efficient monitoring in sensor networks. Algorithmica. 59(1):94-114.
Deshpande A, Hicks MW.  2005.  Toward on-line schema evolution for non-stop systems. 11th High Performance Transaction Systems Workshop.
Deshpande A.  2010.  Increasing representational power and scaling reasoning in probabilistic databases. Proceedings of the 13th International Conference on Database Theory. :1-1.
Deshpande A, Huang R, Raman V, Riggs T, Song D, Subramanian L.  1999.  A Study of the Structure of the Web. University of California, Berkeley.
Deshpande A, Madden S.  2006.  MauveDB: supporting model-based user views in database systems. Proceedings of the 2006 ACM SIGMOD international conference on Management of data. :73-84.
Deshpande A, Hellerstein J.  2002.  On using correlation-based synopses during query optimization. Computer Science Division (EECS), University of California Berkeley.
Deshmukh AS, Gupta SK, Karnik MV, Sriram RD.  2005.  A system for performing content-based searches on a database of mechanical assemblies.
Deshmukh AS, Banerjee A G, Gupta SK, Sriram RD.  2008.  Content-based assembly search: A step towards assembly reuse. Computer-Aided Design. 40(2):244-261.
DeRose L, Ekanadham K, Hollingsworth J, Sbaraglia S.  2002.  SIGMA: A Simulator Infrastructure to Guide Memory Analysis. SC Conference. :1-1.
Der SZ, Zheng Q, Redman B, Chellappa R, Mahmoud H.  2002.  View-Based Recognition of Military Vehicles in Ladar Imagery Using CAD Model Matching. OPTICAL ENGINEERING-NEW YORK-MARCEL DEKKER INCORPORATED-. 78:151-188.
Deng Y, Hung E, V.S. Subrahmanian.  2004.  Maintaining RDF views.
Demner-Fushman D, Jimmy Lin.  2007.  Answering Clinical Questions with Knowledge-Based and Statistical Techniques. Computational Linguistics. 33(1):63-103.
Demner-Fushman D, Oard D.  2003.  The effect of bilingual term list size on dictionary-based cross-language information retrieval. Proceedings of the 36th Annual Hawaii International Conference on System Sciences, 2003.
DeMenthon D, Stuckelberg VM, Doermann D.  2000.  Hidden Markov Models for Images. ICPR. :147-150.
DeMenthon D, Kobla V, Doermann D.  1998.  Video Summarization by Curve Simplification. LAMP-TR-018,CFAR-TR-889,CS-TR-3916
DeMenthon D, Doermann D, Kobla V.  1998.  Video Summarization by Curve Simplification. Proceedings of ACM - Multimedia 98, Bristol, England. :211-218.
DeMenthon D, Doermann D.  2003.  Video Retrieval using Spatio-Temporal Descriptors. ACMMultimedia '03. :508-517.
DeMenthon D, Doermann D.  2006.  Video Retrieval of Near-Duplicates using k-Nearest Neighbor Retrieval of Spatio-Temporal Descriptors. Multimedia Tools and Applications (MTAP). 30
Demaine ED, Hajiaghayi MT, Feige U, Salavatipour MR.  2006.  Combination can be hard: Approximability of the unique coverage problem. Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. :162-171.
Demaine ED, Ghodsi M, Hajiaghayi MT, Sayedi-Roshkhar AS, Zadimoghaddam M.  2007.  Scheduling to minimize gaps and power consumption. Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures. :46-54.
Demaine E, Hajiaghayi MT, Thilikos D.  2002.  Exponential speedup of fixed-parameter algorithms on K 3, 3-minor-free or K 5-minor-free graphs. Algorithms and Computation. :277-287.

Pages