Searching for authors named "Rina Panigrahy" – sorted by Relevance.
-
Nearest Neighbor Search using Kd-trees
- Nearest Neighbor Search using Kd-trees Rina Panigrahy ∗ December 4, 2006 Abstract We suggest a
- Add To MetaCart
-
Clustering to Minimize the Sum of Cluster Diameters
- Clustering to Minimize the Sum of Cluster Diameters Moses Charikar*Princeton University Rina
- Cited by 21 (2 self) – Add To MetaCart
-
On the Decidability of Accessibility Problems (Extended Abstract)
- University Rina Panigrahy y Cisco Systems Vijay Saraswat z AT&T Labs -- Research Suresh
- Cited by 5 (0 self) – Add To MetaCart
-
Web Caching with Request Reordering
- Web Caching With Request Reordering Tomas Feder Rajeev Motwani y Rina Panigrahy z An Zhu x
- Cited by 4 (0 self) – Add To MetaCart
-
Using Bloom Filters to Speed Up HITS-like Ranking Algorithms
- , and Rina Panigrahy Microsoft Research, Mountain View CA 94043, USA Abstract. This paper describes a
- Cited by 2 (2 self) – Add To MetaCart
-
Search and Retrieval—search process, selection process
- , CA, USA sreenig@(email omitted); Rina Panigrahy Microsoft Research Mountain View, CA, USA rina
- Add To MetaCart
-
Better Streaming Algorithms for Clustering Problems
- 30 Rina Panigrahy ‡ Cisco Systems particular, the streaming model has received a lot of attention [3
- Cited by 54 (1 self) – Add To MetaCart
-
New algorithms for subset query, partial match, orthogonal range searching, and related problems
- Moses Charikar1, Piotr Indyk2, and Rina Panigrahy3 1 Princeton University moses@(email omitted); 2 MIT
- Cited by 5 (2 self) – Add To MetaCart
-
Lower bounds on locality sensitive hashing
- Lower bounds on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given
- Cited by 6 (2 self) – Add To MetaCart
-
A geometric approach to lower bounds for approximate near-neighbor search and partial match
- A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match Rina
- Cited by 1 (0 self) – Add To MetaCart

