Publications
Export 7148 results:
[ Author] Title Type Year Filters: Robotson-crusoe%E2%80%93or%E2%80%93what-common-sense is [Clear All Filters]
2002. Decoupled query optimization for federated database systems. 18th International Conference on Data Engineering, 2002. Proceedings. :716-727.
2005. Toward on-line schema evolution for non-stop systems. 11th High Performance Transaction Systems Workshop.
2010. Increasing representational power and scaling reasoning in probabilistic databases. Proceedings of the 13th International Conference on Database Theory. :1-1.
2006. MauveDB: supporting model-based user views in database systems. Proceedings of the 2006 ACM SIGMOD international conference on Management of data. :73-84.
2002. On using correlation-based synopses during query optimization. Computer Science Division (EECS), University of California Berkeley.
2005. Exploiting Correlated Attributes in Acquisitional Query Processing. 21st International Conference on Data Engineering, 2005. ICDE 2005. Proceedings. :143-154.
2003. IRIS: Internet-scale Resource-Intensive Sensor Services. Intel Research, UC Berkeley, Carnegie Mellon University.
2008. Content-based assembly search: A step towards assembly reuse. Computer-Aided Design. 40(2):244-261.
2002. View-Based Recognition of Military Vehicles in Ladar Imagery Using CAD Model Matching. OPTICAL ENGINEERING-NEW YORK-MARCEL DEKKER INCORPORATED-. 78:151-188.
2004. Maintaining RDF views.
2007. Answering Clinical Questions with Knowledge-Based and Statistical Techniques. Computational Linguistics. 33(1):63-103.
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.
2006. Video Retrieval of Near-Duplicates using k-Nearest Neighbor Retrieval of Spatio-Temporal Descriptors. Multimedia Tools and Applications (MTAP). 30
1998. Video Summarization by Curve Simplification. Proceedings of ACM - Multimedia 98, Bristol, England. :211-218.
2002. Exponential speedup of fixed-parameter algorithms on K 3, 3-minor-free or K 5-minor-free graphs. Algorithms and Computation. :277-287.
2005. Algorithmic graph minor theory: Decomposition, approximation, and coloring. Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on. :637-646.
2006. Combination can be hard: Approximability of the unique coverage problem. Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. :162-171.