Linear time algorithms for visibility and shortest path problems inside simple polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
A general approach to d-dimensional geometric queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Optimal algorithms for approximate clustering
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A randomized algorithm for closest-point queries
SIAM Journal on Computing
An O(n log n) algorithm for the all-nearest-neighbors problem
Discrete & Computational Geometry
The design and analysis of spatial data structures
The design and analysis of spatial data structures
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An optimal algorithm for the on-line closest-pair problem
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Approximate closest-point queries in high dimensions
Information Processing Letters
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Randomized data structures for the dynamic closest-pair problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space
ACM Transactions on Mathematical Software (TOMS)
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
An algorithm for approximate closest-point queries
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
New techniques for exact and approximate dynamic closest-point problems
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
An optimal algorithm for closest pair maintenance (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Proceedings of the eleventh annual symposium on Computational geometry
Accounting for boundary effects in nearest neighbor searching
Proceedings of the eleventh annual symposium on Computational geometry
MARCO: MAp Retrieval by COntent
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
Locality-preserving hashing in multidimensional spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximate nearest neighbor queries revisited
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Improved algorithms for robust point pattern matching and applications to image registration
Proceedings of the fourteenth annual symposium on Computational geometry
Effective nearest neighbors searching on the hyper-cube, with applications to molecular clustering
Proceedings of the fourteenth annual symposium on Computational geometry
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Approximate Geometric Pattern Matching Under Rigid Motions
IEEE Transactions on Pattern Analysis and Machine Intelligence
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Lower bounds for high dimensional nearest neighbor search and related problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Algorithms for dynamic closest pair and n-body potential fields
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximating matrix multiplication for pattern recognition tasks
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computing nearest neighbors for moving points and applications to clustering
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Tighter bounds for nearest neighbor search and related problems in the cell probe model
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Dimensionality reduction techniques for proximity problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Content-Based Image Retrieval at the End of the Early Years
IEEE Transactions on Pattern Analysis and Machine Intelligence
Reductions among high dimensional proximity problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Approximate nearest neighbor algorithms for Frechet distance via product metrics
Proceedings of the eighteenth annual symposium on Computational geometry
Signature extraction for overlap detection in documents
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Low latency photon mapping using block hashing
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Vulnerabilities in similarity search based systems
Proceedings of the eleventh international conference on Information and knowledge management
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Multimedia Tools and Applications
Using spatial data access structures for filtering nearest neighbor queries
Data & Knowledge Engineering
Clustering for Approximate Similarity Search in High-Dimensional Spaces
IEEE Transactions on Knowledge and Data Engineering
Probabilistic proximity search: fighting the curse of dimensionality in metric spaces
Information Processing Letters
VQ-index: an index structure for similarity searching in multimedia databases
Proceedings of the tenth ACM international conference on Multimedia
Non-parametric Nearest Neighbor with Local Adaptation
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
When Is ''Nearest Neighbor'' Meaningful?
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
The Analysis of a Probabilistic Approach to Nearest Neighbor Searching
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
An Efficient High-Dimensional Index Structure Using Cell Signatures for Similarity Search
WAIM '01 Proceedings of the Second International Conference on Advances in Web-Age Information Management
An Empirical Study of a New Approach to Nearest Neighbor Searching
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
A Probabilistic Spell for the Curse of Dimensionality
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Dynamic Compressed Hypertoctrees with Application to the N-Body Problem
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Efficient Image Retrieval through Vantage Objects
VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems
Adapting k-d Trees to Visual Retrieval
VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
K-D Trees Are Better when Cut on the Longest Side
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A Theoretical Analysis of Query Selection for Collaborative Filtering
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
An Architecture of a Web-Based Collaborative Image Search Engine
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Spatial indexing of high-dimensional data based on relative approximation
The VLDB Journal — The International Journal on Very Large Data Bases
Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
Journal of Computer and System Sciences - Special issue on STOC 2000
External memory data structures
Handbook of massive data sets
Efficient Regular Data Structures and Algorithms for Location and Proximity Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Accelerating fractal image compression by multi-dimensional nearest neighbor search
DCC '95 Proceedings of the Conference on Data Compression
On-Line Error Monitoring for Several Data Structures
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
An Efficient Technique for Nearest-Neighbor Query Processing on the SPY-TEC
IEEE Transactions on Knowledge and Data Engineering
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Approximate Nearest Neighbor under edit distance via product metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Probabilistic proximity searching algorithms based on compact partitions
Journal of Discrete Algorithms - SPIRE 2002
Locality-sensitive hashing scheme based on p-stable distributions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Practical methods for shape fitting and kinetic data structures using core sets
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Range Image Fusion for Object Reconstruction and Modeling
CRV '04 Proceedings of the 1st Canadian Conference on Computer and Robot Vision
Searching notated polyphonic music using transportation distances
Proceedings of the 12th annual ACM international conference on Multimedia
A strong lower bound for approximate nearest neighbor searching
Information Processing Letters
Scalable trajectory methods for on-demand analog macromodel extraction
Proceedings of the 42nd annual Design Automation Conference
Space-time tradeoffs for approximate spherical range counting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
ACM Transactions on Database Systems (TODS)
Motion modeling for on-line locomotion synthesis
Proceedings of the 2005 ACM SIGGRAPH/Eurographics symposium on Computer animation
An efficient search algorithm for motion data using weighted PCA
Proceedings of the 2005 ACM SIGGRAPH/Eurographics symposium on Computer animation
Entropy based nearest neighbor search in high dimensions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient algorithms for substring near neighbor problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
High dimensional nearest neighbor searching
Information Systems
Efficient top-k hyperplane query processing for multimedia information retrieval
MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
A fast all nearest neighbor algorithm for applications involving large point-clouds
Computers and Graphics
Finding near neighbors through cluster pruning
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Content-based image retrieval for semiconductor process characterization
EURASIP Journal on Applied Signal Processing
Approximate NN queries on streams with guaranteed error/performance bounds
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Communications of the ACM - 50th anniversary issue: 1958 - 2008
Decomposable algorithms for nearest neighbor computing
Journal of Parallel and Distributed Computing
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On surface reconstruction: A priority driven approach
Computer-Aided Design
Patch-based video processing: a variational Bayesian approach
IEEE Transactions on Circuits and Systems for Video Technology
Kernel Generalized Foley-Sammon Transform with Cluster-Weighted
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
Image and Vision Computing
EBS k-d tree: an entropy balanced statistical k-d tree for image databases with ground-truth labels
CIVR'03 Proceedings of the 2nd international conference on Image and video retrieval
Empirical evaluation of the difficulty of finding a good value of k for the nearest neighbor
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
An improved algorithm finding nearest neighbor using Kd-trees
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Automated data discovery in similarity score queries
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Overlap elimination for registered range images
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Distributed locality sensitivity hashing
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Photo zoom: high resolution from unordered image collections
Proceedings of Graphics Interface 2010
Fast k-NN classifier for documents based on a graph structure
CIARP'10 Proceedings of the 15th Iberoamerican congress conference on Progress in pattern recognition, image analysis, computer vision, and applications
Selecting vantage objects for similarity indexing
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Image-based informatics for preclinical biomedical research
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II
Practical construction of k-nearest neighbor graphs in metric spaces
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
On the least cost for proximity searching in metric spaces
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
MICCAI'05 Proceedings of the 8th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part I
Proximity searching in high dimensional spaces with a proximity preserving order
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Balanced aspect ratio trees revisited
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Probabilistic cost model for nearest neighbor search in image retrieval
Computer Vision and Image Understanding
IRIW: image retrieval based image watermarking for large-scale image databases
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
Interactive system for dynamic scene lighting using captured video environment maps
EGSR'05 Proceedings of the Sixteenth Eurographics conference on Rendering Techniques
A fast k-neighborhood algorithm for large point-clouds
SPBG'06 Proceedings of the 3rd Eurographics / IEEE VGTC conference on Point-Based Graphics
A Multisensor Architecture Providing Location-based Services for Smartphones
Mobile Networks and Applications
Locality sensitive hashing revisited: filling the gap between theory and algorithm analysis
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |