Eric Sadit Tellez

Information Retrieval & Search · 2010–2016

A researcher in the Science corpus: 5 papers; trusts 24 researchers and is trusted by 10 researchers here, as inferred from the citation graph.

Subfields

• Information Retrieval & Search — 21 citations into it; #366 of 1,022 by trust here, #690 by citations
• Signal Processing — 21 citations into it; #2,123 of 7,572 by trust here, #4,201 by citations
• Artificial Intelligence — 19 citations into it; #15,389 of 35,345 by trust here, #25,040 by citations
• Computer Vision and Pattern Recognition — 19 citations into it; #7,785 of 21,575 by trust here, #14,822 by citations
• Algorithms & Complexity — 7 citations into it; #244 of 516 by trust here, #302 by citations
• Computer Graphics and Computer-Aided Design — 7 citations into it; #1,038 of 1,584 by trust here, #1,534 by citations
• Computer Networks and Communications — 5 citations into it
• Molecular Biology — 5 citations into it

Whom Eric Sadit Tellez trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Gonzalo Navarro
2. Hanan Samet
3. Edgar Chávez
4. Peter Elias
5. Gísli R. Hjaltason
6. Daisuke Okanohara
7. Christian Böhm
8. Simon J. Puglisi
9. Karina Figueroa
10. Ricardo A. Baeza-Yates

Who trusts Eric Sadit Tellez overall

1. Yury Malkov
2. Alexander Ponomarenko
3. Bilegsaikhan Naidan
4. Edgar Chávez
5. Leonid Boytsov
6. Mario Graff
7. Andrey Logvinov
8. N. Avrelin
9. Eric Nyberg
10. Vladimir V. Krylov

Papers from Eric Sadit Tellez's perspective

Ordered by how strongly the researchers Eric Sadit Tellez trusts endorse each paper. Same corpus, a different order for every researcher.

1. An optimal algorithm for approximate nearest neighbor searching fixed dimensions
2. Data structures and algorithms for nearest neighbor search in general metric spaces
3. Similarity Search in High Dimensions via Hashing
4. Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
5. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets (ACM-SIAM Symposium on Discrete Algorithms)
6. Multidimensional binary search trees used for associative searching
7. High-order entropy-compressed text indexes
8. Searching in metric spaces by spatial approximation
9. Succinct nearest neighbor search
10. Scalable Distributed Algorithm for Approximate Nearest Neighbor Search Problem in High Dimensional General Metric Spaces

Their papers

• Singleton indexes for nearest neighbor search (2016) — 8 citations
• Near neighbor searching with K nearest references (2015) — 31 citations
• Finding Near Neighbors Through Local Search (2015) — 9 citations
• Succinct nearest neighbor search (2011) — 42 citations
• Navigating K-Nearest Neighbor Graphs to Solve Nearest Neighbor Searches (2010) — 15 citations