Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Igor Olonetsky

dblp:119/1519 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithms and data structures · 100%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures › similarity search › nearest neighbor search
approximate nearest neighbor search		 0.112012
TreeCANN - k-d Tree Coherence Approximate Nearest Neighbor Algorithm · ECCV (4) 2012
Algorithms and data structures › similarity search
nearest neighbor search		 0.112012
TreeCANN - k-d Tree Coherence Approximate Nearest Neighbor Algorithm · ECCV (4) 2012
Geometric modeling and processing › spatial data structures
k-d tree		 0.012012
TreeCANN - k-d Tree Coherence Approximate Nearest Neighbor Algorithm · ECCV (4) 2012

Methods — techniques the papers use, named apart from their topics

k-d tree coherence · 0.3
YearPublicationVenuePosition
2012 TreeCANN - k-d Tree Coherence Approximate Nearest Neighbor Algorithm
Igor Olonetsky, Shai Avidan
 ECCV (4)1