| 













 | |  | |  |
On Random Sampling over Joins
Similarity Search in High Dimensions via Hashing
Note: Links lead to the DBLP on the Web.
Rajeev Motwani
71
Moses Charikar
,
Surajit Chaudhuri
, Rajeev Motwani,
Vivek R. Narasayya
: Towards Estimation Error Guarantees for Distinct Values.
PODS 2000
: 0-
70
Rajeev Motwani,
P. Raghavan
: Guest Editors' Foreword.
Algorithmica 26
(3-4): 311-312 (2000)
69
Surajit Chaudhuri
, Rajeev Motwani,
Vivek R. Narasayya
: On Random Sampling over Joins.
SIGMOD Conference 1999
: 263-274
68
Piotr Indyk
, Rajeev Motwani,
Suresh Venkatasubramanian
: Geometric Matching Under Noise: Combinatorial Bounds and Algorithms.
SODA 1999
: 457-465
67
Chandra Chekuri
, Rajeev Motwani: Minimizing Weighted Completion Time on a Single Machine.
SODA 1999
: 873-874
66
Tomás Feder
,
Pavol Hell
,
Sulamita Klein
, Rajeev Motwani: Complexity of Graph Partition Problems.
STOC 1999
: 464-472
65
Martin Gavrilov
,
Piotr Indyk
, Rajeev Motwani,
Suresh Venkatasubramanian
: Geometric Pattern Matching: A Performance Study.
Symposium on Computational Geometry 1999
: 79-85
64
Aristides Gionis
,
Piotr Indyk
, Rajeev Motwani: Similarity Search in High Dimensions via Hashing.
VLDB 1999
: 518-529
63
Surajit Chaudhuri
, Rajeev Motwani: On Sampling and Relational Operators.
IEEE Data Engineering Bulletin 22
(4): 41-46 (1999)
62
Shalom Tsur
,
Jeffrey D. Ullman
,
Serge Abiteboul
,
Chris Clifton
, Rajeev Motwani,
Svetlozar Nestorov
,
Arnon Rosenthal
: Query Flocks: A Generalization of Association-Rule Mining.
SIGMOD Conference 1998
: 1-12
61
Svetlozar Nestorov
,
Serge Abiteboul
, Rajeev Motwani: Extracting Schema from Semistructured Data.
SIGMOD Conference 1998
: 295-306
60
Surajit Chaudhuri
, Rajeev Motwani,
Vivek R. Narasayya
: Random Sampling for Histogram Construction: How much is enough?
SIGMOD Conference 1998
: 436-447
59
Moses Charikar
,
Dan Halperin
, Rajeev Motwani: The Dynamic Servers Problem.
SODA 1998
: 410-419
58
Piotr Indyk
, Rajeev Motwani: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality.
STOC 1998
: 604-613
57
Min Fang
,
Narayanan Shivakumar
,
Hector Garcia-Molina
, Rajeev Motwani,
Jeffrey D. Ullman
: Computing Iceberg Queries Efficiently.
VLDB 1998
: 299-310
56
Craig Silverstein
,
Sergey Brin
, Rajeev Motwani,
Jeffrey D. Ullman
: Scalable Techniques for Mining Causal Structures.
VLDB 1998
: 594-605
55
Sanjeev Khanna
, Rajeev Motwani,
Randall H. Wilson
: On Certificates and Lookahead in Dynamic Graph Problems.
Algorithmica 21
(4): 377-394 (1998)
54
Sergey Brin
, Rajeev Motwani,
Lawrence Page
,
Terry Winograd
: What can you do with a Web in your Pocket?
Data Engineering Bulletin 21
(2): 37-47 (1998)
53
Craig Silverstein
,
Sergey Brin
, Rajeev Motwani: Beyond Market Baskets: Generalizing Association Rules to Dependence Rules.
Data Mining and Knowledge Discovery 2
(1): 39-68 (1998)
52
Sanjeev Arora
,
Carsten Lund
, Rajeev Motwani,
Madhu Sudan
,
Mario Szegedy
: Proof verification and the hardness of approximation problems.
Electronic Colloquium on Computational Complexity (ECCC) 5
(008): (1998)
51
Rajeev Motwani: Realization of Matrices and Directed Graphs.
J. Algorithms 27
(1): 61-74 (1998)
50
David R. Karger
, Rajeev Motwani,
Madhu Sudan
: Approximate Graph Coloring by Semidefinite Programming.
JACM 45
(2): 246-265 (1998)
49
Sanjeev Arora
,
Carsten Lund
, Rajeev Motwani,
Madhu Sudan
,
Mario Szegedy
: Proof Verification and the Hardness of Approximation Problems.
JACM 45
(3): 501-555 (1998)
48
Lydia E. Kavraki
,
Jean-Claude Latombe
, Rajeev Motwani,
Prabhakar Raghavan
: Randomized Query Processing in Robot Path Planning.
JCSS 57
(1): 50-66 (1998)
47
Sergey Brin
, Rajeev Motwani,
Jeffrey D. Ullman
,
Shalom Tsur
: Dynamic Itemset Counting and Implication Rules for Market Basket Data.
SIGMOD Conference 1997
: 255-264
46
Sergey Brin
, Rajeev Motwani,
Craig Silverstein
: Beyond Market Baskets: Generalizing Association Rules to Correlations.
SIGMOD Conference 1997
: 265-276
45
Alok Aggarwal
,
Don Coppersmith
,
Sanjeev Khanna
, Rajeev Motwani,
Baruch Schieber
: The Angular-Metric Traveling Salesman Problem.
SODA 1997
: 221-229
44
Chandra Chekuri
, Rajeev Motwani,
B. Natarajan
,
Clifford Stein
: Approximation Techniques for Average Completion Time Scheduling.
SODA 1997
: 609-618
43
Piotr Indyk
, Rajeev Motwani,
Prabhakar Raghavan
,
Santosh Vempala
: Locality-Preserving Hashing in Multidimensional Spaces.
STOC 1997
: 618-625
42
Moses Charikar
,
Chandra Chekuri
,
Tomás Feder
, Rajeev Motwani: Incremental Clustering and Dynamic Information Retrieval.
STOC 1997
: 626-635
41
P. W. Finn
,
Lydia E. Kavraki
,
Jean-Claude Latombe
, Rajeev Motwani,
Christian R. Shelton
,
Suresh Venkatasubramanian
,
A. Yao
: RAPID: Randomized Pharmacophore Identification for Drug Design.
Symposium on Computational Geometry 1997
: 324-333
40
Rajeev Motwani,
Prabhakar Raghavan
: Randomized Algorithms.
The Computer Science and Engineering Handbook 1997
: 141-161
39
Moses Charikar
, Rajeev Motwani,
Prabhakar Raghavan
,
Craig Silverstein
: Constrained TSP and Low-Power Computing.
WADS 1997
: 104-115
38
Leonidas J. Guibas
,
Jean-Claude Latombe
,
Steven M. LaValle
,
David Lin
, Rajeev Motwani: Visibility-Based Pursuit-Evasion in a Polygonal Environment.
WADS 1997
: 17-30
37
Michael Goldwasser
, Rajeev Motwani: Intractability of Assembly Sequencing: Unit Disks in the Plane.
WADS 1997
: 307-320
36
David R. Karger
, Rajeev Motwani,
G. D. S. Ramkumar
: On Approximating the Longest Path in a Graph.
Algorithmica 18
(1): 82-98 (1997)
35
David R. Karger
, Rajeev Motwani: An NC Algorithm for Minimum Cuts.
SIAM J. Comput. 26
(1): 255-272 (1997)
34
Leonidas J. Guibas
, Rajeev Motwani,
Prabhakar Raghavan
: The Robot Localization Problem.
SIAM J. Comput. 26
(4): 1120-1138 (1997)
33
Svetlozar Nestorov
,
Serge Abiteboul
, Rajeev Motwani: Infering Structure in Semistructured Data.
SIGMOD Record 26
(4): 39-43 (1997)
32
Chandra Chekuri
,
Richard Johnson
, Rajeev Motwani,
B. Natarajan
,
B. Ramakrishna Rau
,
Michael S. Schlansker
: Profile-driven Instruction Level Parallel Scheduling with Application to Super Blocks.
MICRO 1996
: 58-67
31
Sanjeev Khanna
, Rajeev Motwani,
Randall H. Wilson
: On Certificates and Lookahead in Dynamic Graph Problems.
SODA 1996
: 222-231
30
D. Aingworth
,
Chandra Chekuri
, Rajeev Motwani: Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication).
SODA 1996
: 547-553
29
Sanjeev Khanna
, Rajeev Motwani: Towards a Syntactic Characterization of PTAS.
STOC 1996
: 329-337
28
Rajeev Motwani,
Prabhakar Raghavan
: Randomized Algorithms.
Computing Surveys 28
(1): 33-37 (1996)
27
Chandra Chekuri
,
Waqar Hasan
, Rajeev Motwani: Scheduling Problems in Parallel Query Optimization.
PODS 1995
: 255-265
26
Lydia E. Kavraki
,
Jean-Claude Latombe
, Rajeev Motwani,
Prabhakar Raghavan
: Randomized Query Processing in Robot Motion Planning (Extended Abstract).
STOC 1995
: 353-362
25
Waqar Hasan
, Rajeev Motwani: Coloring Away Communication in Parallel Query Optimization.
VLDB 1995
: 239-250
24
Sanjeev Khanna
, Rajeev Motwani,
Madhu Sudan
,
Umesh V. Vazirani
: On Syntactic versus Computational Views of Approximability.
Electronic Colloquium on Computational Complexity (ECCC) 2
(023): (1995)
23
Tomás Feder
, Rajeev Motwani: Clique Partitions, Graph Compression and Speeding-Up Algorithms.
JCSS 51
(2): 261-272 (1995)
22
David R. Karger
, Rajeev Motwani,
Madhu Sudan
: Approximate Graph Coloring by Semidefinite Programming.
FOCS 1994
: 2-13
21
Anil Kamath
, Rajeev Motwani,
Krishna V. Palem
,
Paul G. Spirakis
: Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture.
FOCS 1994
: 592-603
20
Sanjeev Khanna
, Rajeev Motwani,
Madhu Sudan
,
Umesh V. Vazirani
: On Syntactic versus Computational Views of Approximability.
FOCS 1994
: 819-830
19
David R. Karger
, Rajeev Motwani: Derandomization through Approximation: An \calNC Algorithm for Minimum Cuts.
STOC 1994
: 497-506
18
Waqar Hasan
, Rajeev Motwani: Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism.
VLDB 1994
: 36-47
17
Rajeev Motwani: Average-Case Analysis of Algorithms for Matchings and Related Problems.
JACM 41
(6): 1329-1356 (1994)
16
Rajeev Motwani,
Joseph Naor
,
Moni Naor
: The Probabilistic Method Yields Deterministic Parallel Algorithms.
JCSS 49
(3): 478-516 (1994)
15
Rajeev Motwani,
Steven Phillips
,
Eric Torng
: Non-Clairvoyant Scheduling.
TCS 130
(1): 17-47 (1994)
14
Rajeev Motwani,
Steven J. Phillips
,
Eric Torng
: Non-Clairvoyant Scheduling.
SODA 1993
: 422-431
13
David R. Karger
, Rajeev Motwani,
G. D. S. Ramkumar
: On Approximating the Longest Path in a Graph (Preliminary Version).
WADS 1993
: 421-432
12
Sanjeev Arora
,
Carsten Lund
, Rajeev Motwani,
Madhu Sudan
,
Mario Szegedy
: Proof Verification and Hardness of Approximation Problems.
FOCS 1992
: 14-23
11
Leonidas J. Guibas
, Rajeev Motwani,
Prabhakar Raghavan
: The Robot Localization Problem in Two Dimensions.
SODA 1992
: 259-268
10
Amotz Bar-Noy
, Rajeev Motwani,
Joseph Naor
: The Greedy Algorithm is Optimal for On-Line Edge Coloring.
IPL 44
(5): 251-253 (1992)
9
Tomás Feder
, Rajeev Motwani: Clique Partitions, Graph Compression, and Speeding-Up Algorithms.
STOC 1991
: 123-133
8
Donald E. Knuth
, Rajeev Motwani,
Boris Pittel
: Stable Husbands.
SODA 1990
: 397-404
7
Rajeev Motwani,
Arvind Raghunathan
,
Huzur Saran
: Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach.
JCSS 40
(1): 19-48 (1990)
6
Rajeev Motwani,
Joseph Naor
,
Moni Naor
: The Probabilistic Method Yields Deterministic Parallel Algorithms.
FOCS 1989
: 8-13
5
Rajeev Motwani: Expanding Graphs and the Average-case Analysis of Algorithms for Matchings and Related Problems.
STOC 1989
: 550-561
4
Rajeev Motwani,
Arvind Raghunathan
,
Huzur Saran
: Constructive Results from Graph Minors: Linkless Embeddings.
FOCS 1988
: 398-409
3
Rajeev Motwani,
Arvind Raghunathan
,
Huzur Saran
: Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach.
Symposium on Computational Geometry 1988
: 211-223
2
Richard M. Karp
, Rajeev Motwani,
Prabhakar Raghavan
: Deferred Data Structuring.
SIAM J. Comput. 17
(5): 883-902 (1988)
1
Rajeev Motwani,
Prabhakar Raghavan
: Deferred Data Structuring: Query-Driven Preprocessing for Geometric Search Problems.
Symposium on Computational Geometry 1986
: 303-312
Copyright(C) 2000 ACM | | | | | | |