| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Gautam Das Gautam Das, Bing Liu , Philip S. Yu : Proceedings of the 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, DMKD 2004, Paris, France, June 13, 2004 ACM 2004 Gautam Das, Ved Prakash Gulati : Intelligent Information Technology, 7th International Conference on Information Technology, CIT 2004, Hyderabad, India, December 20-23, 2004, Proceedings Springer 2004 Michail Vlachos , Dimitrios Gunopulos , Gautam Das: Rotation invariant distance measures for trajectories. KDD 2004 : 707-712 Surajit Chaudhuri , Gautam Das, Utkarsh Srivastava : Effective Use of Block-Level Sampling in Statistics Estimation. SIGMOD Conference 2004 : 287-298 Surajit Chaudhuri , Gautam Das, Vagelis Hristidis , Gerhard Weikum : Probabilistic Ranking of Database Query Results. VLDB 2004 : 888-899 Yi-Min Wang , Lili Qiu , Chad Verbowski , Dimitris Achlioptas , Gautam Das, Paul Larson : Summary-based routing for content-based event distribution networks. Computer Communication Review 34 (5): 59-74 (2004) Sanjay Agrawal , Surajit Chaudhuri , Gautam Das, Aristides Gionis : Automated Ranking of Database Query Results. CIDR 2003 Brian Babcock , Surajit Chaudhuri , Gautam Das: Dynamic Sample Selection for Approximate Query Processing. SIGMOD Conference 2003 : 539-550 Sanjay Agrawal , Surajit Chaudhuri , Gautam Das: DBXplorer: A System for Keyword-Based Search over Relational Databases. ICDE 2002 : 5-16 Sanjay Agrawal , Surajit Chaudhuri , Gautam Das: DBXplorer: enabling keyword search over relational databases. SIGMOD Conference 2002 : 627 Binay K. Bhattacharya , Gautam Das, Asish Mukhopadhyay , Giri Narasimhan : Optimally computing a shortest weakly visible line segment inside a simple polygon. Comput. Geom. 23 (1): 1-29 (2002) Surajit Chaudhuri , Gautam Das, Mayur Datar , Rajeev Motwani , Vivek R. Narasayya : Overcoming Limitations of Sampling for Aggregation Queries. ICDE 2001 : 534-542 Surajit Chaudhuri , Gautam Das, Vivek R. Narasayya : A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries. SIGMOD Conference 2001 Dimitrios Gunopulos , Gautam Das: Time Series Similarity Measures and Time Series Indexing. SIGMOD Conference 2001 Danny Z. Chen , Gautam Das, Michiel H. M. Smid : Lower bounds for computing geometric spanners and approximate shortest paths. Discrete Applied Mathematics 110 (2-3): 151-167 (2001) Béla Bollobás , Gautam Das, Dimitrios Gunopulos , Heikki Mannila : Time-Series Similarity Problems and Well-Separated Geometric Sets. Nord. J. Comput. 8 (4): 409-423 (2001) Gautam Das, Heikki Mannila : Context-Based Similarity Measures for Categorical Databases. PKDD 2000 : 201-210 Gautam Das, Michiel H. M. Smid : A lower bound for approximating the geometric minimum weight matching. Inf. Process. Lett. 74 (5-6): 253-255 (2000) Gautam Das, King-Ip Lin , Heikki Mannila , Gopal Renganathan , Padhraic Smyth : Rule Discovery from Time Series. KDD 1998 : 16-22 Gautam Das, Heikki Mannila , Pirjo Ronkainen : Similarity of Attributes by External Probes. KDD 1998 : 23-29 Gautam Das: The visibility graph contains a bounded-degree spanner. CCCG 1997 Gautam Das, Rudolf Fleischer , Leszek Gasieniec , Dimitrios Gunopulos , Juha Kärkkäinen : Episode Matching. CPM 1997 : 12-27 Gautam Das, Dimitrios Gunopulos , Heikki Mannila : Finding Similar Time Series. PKDD 1997 : 88-100 Béla Bollobás , Gautam Das, Dimitrios Gunopulos , Heikki Mannila : Time-Series Similarity Problems and Well-Separated Geometric Sets. Symposium on Computational Geometry 1997 : 454-456 Gautam Das, Sanjiv Kapoor , Michiel H. M. Smid : On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. Algorithmica 19 (4): 447-460 (1997) Gautam Das, Paul J. Heffernan , Giri Narasimhan : LR-visibility in Polygons. Comput. Geom. 7 : 37-57 (1997) Gautam Das, Michael T. Goodrich : On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees. Comput. Geom. 8 : 123-137 (1997) Gautam Das, Giri Narasimhan : A Fast Algorithm for Constructing Sparse Euclidean Spanners. Int. J. Comput. Geometry Appl. 7 (4): 297-315 (1997) Danny Z. Chen , Gautam Das, Michiel H. M. Smid : Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. CCCG 1996 : 155-160 Srinivasa Rao Arikati , Danny Z. Chen , L. Paul Chew , Gautam Das, Michiel H. M. Smid , Christos D. Zaroliagis : Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. ESA 1996 : 514-528 Gautam Das, Sanjiv Kapoor , Michiel H. M. Smid : On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. FSTTCS 1996 : 64-75 Gautam Das, Paul J. Heffernan : Constructing Degree-3 Spanners with Other Sparseness Properties. Int. J. Found. Comput. Sci. 7 (2): 121-136 (1996) Gautam Das, Giri Narasimhan , Jeffrey S. Salowe : A New Way to Weigh Malnourished Euclidean Graphs. SODA 1995 : 215-222 Sunil Arya , Gautam Das, David M. Mount , Jeffrey S. Salowe , Michiel H. M. Smid : Euclidean spanners: short, thin, and lanky. STOC 1995 : 489-498 Gautam Das, Michael T. Goodrich : On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). WADS 1995 : 74-85 Barun Chandra , Gautam Das, Giri Narasimhan , José Soares : New sparseness results on graph spanners. Int. J. Comput. Geometry Appl. 5 : 125-144 (1995) Gautam Das, Paul J. Heffernan , Giri Narasimhan : Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). SWAT 1994 : 119-130 Gautam Das, Giri Narasimhan : A Fast Algorithm for Constructing Sparse Euclidean Spanners. Symposium on Computational Geometry 1994 : 132-139 Gautam Das, Giri Narasimhan : Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. Symposium on Computational Geometry 1994 : 259-266 Gautam Das, Paul J. Heffernan , Giri Narasimhan : Finding all Weakly-Visible Chords of a Polygon in Linear Time. Nord. J. Comput. 1 (4): 433-457 (1994) Gautam Das, Paul J. Heffernan , Giri Narasimhan : LR-visibility in Polygons. CCCG 1993 : 303-308 Gautam Das, Paul J. Heffernan : Constructing Degree-3 Spanners with Other Sparseness Properties. ISAAC 1993 : 11-20 Gautam Das, Paul J. Heffernan , Giri Narasimhan : Optimally Sparse Spanners in 3-Dimensional Euclidean Space. Symposium on Computational Geometry 1993 : 53-62 Ingo Althöfer , Gautam Das, David P. Dobkin , Deborah Joseph , José Soares : On Sparse Spanners of Weighted Graphs. Discrete & Computational Geometry 9 : 81-100 (1993) Barun Chandra , Gautam Das, Giri Narasimhan , José Soares : New Sparseness Results on Graph Spanners. Symposium on Computational Geometry 1992 : 192-201 Gautam Das, Deborah Joseph : Minimum Vertex Hulls for Polyhedral Domains. Theor. Comput. Sci. 103 (1): 107-135 (1992) Gautam Das, Giri Narasimhan : Geometric Searching and Link Distance (Extended Abstract). WADS 1991 : 261-272 Gautam Das, Deborah Joseph : Minimum Vertex Hulls for Polyhedral Domains. STACS 1990 : 126-137 Ingo Althöfer , Gautam Das, David P. Dobkin , Deborah Joseph : Generating Sparse Spanners for Weighted Graphs. SWAT 1990 : 26-37 Gautam Das, Deborah Joseph : Which Triangulations Approximate the Complete Graph?. Optimal Algorithms 1989 : 168-192 1 [ 45 ] 2 [ 41 ] [ 42 ] [ 44 ] 3 [ 2 ] [ 7 ] 4 [ 21 ] 5 [ 17 ] 6 [ 43 ] 7 [ 40 ] 8 [ 27 ] [ 35 ] 9 [ 6 ] [ 15 ] 10 [ 38 ] [ 39 ] [ 41 ] [ 42 ] [ 43 ] [ 44 ] [ 46 ] [ 47 ] 11 [ 21 ] [ 22 ] [ 36 ] 12 [ 21 ] 13 [ 39 ] 14 [ 2 ] [ 7 ] 15 [ 29 ] 16 [ 29 ] 17 [ 44 ] 18 [ 16 ] [ 24 ] 19 [ 49 ] 20 [ 27 ] [ 28 ] [ 29 ] [ 35 ] [ 37 ] [ 48 ] 21 [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 14 ] [ 19 ] [ 25 ] 22 [ 46 ] 23 [ 1 ] [ 2 ] [ 3 ] [ 5 ] [ 7 ] 24 [ 20 ] [ 26 ] 25 [ 29 ] 26 [ 45 ] 27 [ 32 ] 28 [ 50 ] 29 [ 27 ] [ 28 ] [ 31 ] [ 32 ] [ 34 ] [ 35 ] 30 [ 39 ] 31 [ 17 ] 32 [ 40 ] 33 [ 38 ] [ 39 ] 34 [ 4 ] [ 6 ] [ 8 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 18 ] [ 23 ] [ 25 ] [ 40 ] 35 [ 45 ] 36 [ 32 ] 37 [ 31 ] 38 [ 17 ] [ 18 ] 39 [ 17 ] [ 20 ] [ 21 ] [ 22 ] [ 26 ] [ 33 ] [ 36 ] 40 [ 32 ] 41 [ 6 ] [ 7 ] [ 15 ] 42 [ 47 ] 43 [ 45 ] 44 [ 48 ] 45 [ 45 ] 46 [ 46 ] 47 [ 50 ] 48 [ 21 ]  ©2005 Association for Computing Machinery |
