Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design

By Y. Lifshits, Shengyu Zhang. 2009

35 citations recorded by the source corpus.

Subfields: Geography, Planning and Development, Ocean Engineering, Information Retrieval & Search, Algorithms & Complexity, Signal Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Geography, Planning and Development

1. Alexander Ponomarenko

In Ocean Engineering

1. Alexander Ponomarenko

In Information Retrieval & Search

1. David A. Ross
2. Alexander Ponomarenko
3. Dennis W. Strelow
4. Jay Yagnik
5. Ruei-Sung Lin
6. Michael E. Houle
7. Michael Nett

In Algorithms & Complexity

1. Alexander Ponomarenko
2. Michael E. Houle
3. Michael Nett

In Signal Processing

1. Alexander Ponomarenko
2. Michael E. Houle
3. Michael Nett

Citations in the corpus

• Query-Based Improvement Procedure and Self-Adaptive Graph Construction Algorithm for Approximate Nearest Neighbor Search (2015, background): “Several works based on this approach have been proposed [2,4,5].”
• The power of comparative reasoning (2011, background): “[9, 8] study properties of such algorithms that utilize a comparison oracle.”
• Rank-Based Similarity Search: Reducing the Dimensional Dependence (2015, background): “In [36], Lifshits and Zhang showed that disorder inequalities and expansion rates are related, in that D (cid:6) d 2 .”
• Growing Homophilic Networks Are Natural Navigable Small Worlds (2015, unknown): “[23 – 25] to solve this problem; their realization, nonetheless, was far from practical applications.”