Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

The PageRank Citation Ranking : Bringing Order to the Web

- L. Page, S. Brin, R. Motwani, T. Winograd
- Computer Science
- WWW
- 11 November 1999

The importance of a Web page is an inherently subjective matter, which depends on the readers interests, knowledge and attitudes. But there is still much that can be said objectively about the… Expand

- 12,336
- 1658

Approximate nearest neighbors: towards removing the curse of dimensionality

- P. Indyk, R. Motwani
- Computer Science
- STOC '98
- 23 May 1998

We present two algorithms for the approximate nearest neighbor problem in high-dimensional spaces. For data sets of size n living in R d , the algorithms require space that is only polynomial in n… Expand

Similarity Search in High Dimensions via Hashing

- A. Gionis, P. Indyk, R. Motwani
- Computer Science
- VLDB
- 7 September 1999

The nearestor near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing interest in building… Expand

Models and issues in data stream systems

- B. Babcock, S. Babu, Mayur Datar, R. Motwani, J. Widom
- Computer Science
- PODS '02
- 3 June 2002

In this overview paper we motivate the need for and research issues arising from a new model of data processing. In this model, data does not take the form of persistent relations, but rather arrives… Expand

Randomized Algorithms

- R. Motwani, P. Raghavan
- Computer Science
- SIGA
- 1 September 1995

For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of… Expand

Dynamic itemset counting and implication rules for market basket data

- S. Brin, R. Motwani, J. Ullman, S. Tsur
- Computer Science
- SIGMOD '97
- 1 June 1997

We consider the problem of analyzing market-basket data and present several important contributions. First, we present a new algorithm for finding large itemsets which uses fewer passes over the data… Expand

Beyond market baskets: generalizing association rules to correlations

- S. Brin, R. Motwani, Craig Silverstein
- Computer Science
- SIGMOD '97
- 1 June 1997

One of the most well-studied problems in data mining is mining for association rules in market basket data. Association rules, whose significance is measured via support and confidence, are intended… Expand

Approximate Frequency Counts over Data Streams

- G. S. Manku, R. Motwani
- Computer Science
- Proc. VLDB Endow.
- 1 August 2012

Research in data stream algorithms has blossomed since late 90s. The talk will trace the history of the Approximate Frequency Counts paper, how it was conceptualized and how it influenced data stream… Expand

Maintaining Stream Statistics over Sliding Windows

- Mayur Datar, A. Gionis, P. Indyk, R. Motwani
- Mathematics, Computer Science
- SIAM J. Comput.
- 1 June 2002

We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding window model. We… Expand

Proof verification and hardness of approximation problems

- Sanjeev Arora, Carsten Lund, R. Motwani, M. Sudan, M. Szegedy
- Computer Science, Mathematics
- Proceedings., 33rd Annual Symposium on…
- 1992

The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that used O(f(n)) random bits, queries O(g(n)) bits of its oracle and… Expand