Kapoor, N., G. Das, V. Hristidis, S. Sudarshan and G. Weikum: STAR: A System for Tuple and Attribute Ranking of Query Answers (Demo). In: ICDE 2007 : 2007 IEEE 23rd International Conference on Data Engineering IEEE Computer Society, Los Alamitos, CA, USA (2007) 1483-1484.
doi: 10.1109/ICDE.2007.369044
localid: C12573CC004A8E26-9DB18CE90E9A5DD5C125728800482261-KapoorDHSW07
Chaudhuri, S., G. Das, V. Hristidis and G. Weikum: Probabilistic information retrieval approach for ranking of database query results. In: ACM Transactions on Database Systems 31, 1134-1168 (2006).
localid: C1256DBF005F876D-89A90B60B4C6A2B7C125728800468C46-ChaudhuriDHW06
Chaudhuri, S., G. Das, V. Hristidis and G. Weikum: Probabilistic Ranking of Database Query Results. In: Proceedings 2004 VLDB Conference : The 30th International Conference on Very Large Databases (VLDB) Morgan Kaufmann, St. Louis, USA (2004) 888-899.
localid: C1256DBF005F876D-6A49EE9F04259CF0C1256F80005257A6-ChaudhuriDHW04
Das, G., R. Fleischer, L. Gasieniec, D. Gunopulos and J. Kärkkäinen: Episode matching. In: Combinatorial pattern matching : 8th annual symposium (CPM-97), (Eds.) Apostolico, Alberto; Hein, Jotun. Lecture Notes in Computer Science. Springer, Berlin, Germany (1997) 12-27.
localid: C1256428004B93B8-AE3FF5F2B9D40A90C12564C300285F0E-Das-et-al97
Das, G., S. Kapoor and M. Smid: On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees. In: Algorithmica 19, 447-460 (1997).
localid: C1256428004B93B8-CE15E244BDCE3C21C1256745002F5F55-Das-Kapoor-Smid97
Chen, D.Z., G. Das and M. Smid: Lower bounds for computing geometric spanners and approximate shortest paths. In: 8th Canadian Conference on Computing Carleton, - (1996) 155-160.
localid: C1256428004B93B8-5468590C0DFFEFCEC125648F00326654-Chen-Das-Smid96
Das, G., S. Kapoor and M. Smid: On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees. In: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference, (Eds.) Chandru, V.; Vinay, V. Lecture Notes in Computer Science. Springer, Berlin, Germany (1996) 64-75.
localid: C1256428004B93B8-78ADA2C4CA0EA6CAC12564C300289F45-Das-Kapoor-Smid96
Arikati, S.R., D.Z. Chen, L.P. Chew, G. Das, M. Smid and C. Zaroliagis: Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. In: Algorithms - ESA '96: 4th Annual European Symposium, (Eds.) Diaz, Josep; Serna, Maria. Lecture Notes in Computer Science. Springer, Berlin (1996) 514-528.
localid: C1256428004B93B8-BE9D285FD07505FAC125642F00511EBE-Zaroliagis96
Arya, S., G. Das, D.M. Mount, J.S. Salowe and M. Smid: Euclidean spanners: short, thin, and lanky. In: 27th Annual ACM Symposium on Theory of Computing (STOC95) acm-Press, New York (1995) 489-498.
localid: C1256428004B93B8-09B7D45FC8F26C1EC125645A0031F8F6-Arya-Smid95
http://edoc.mpg.de
The Max Planck Society does not take any responsibility for the content of this export.