An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Multidimensional divide-and-conquer
Communications of the ACM
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On constructing minimum spanning trees in k-dimensional spaces and related problems
On constructing minimum spanning trees in k-dimensional spaces and related problems
Computational geometry.
Statistical methods in algorithm design and analysis.
Statistical methods in algorithm design and analysis.
SCG '86 Proceedings of the second annual symposium on Computational geometry
A sweepline algorithm for Voronoi diagrams
SCG '86 Proceedings of the second annual symposium on Computational geometry
A probabilistic algorithm for the post office problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Multivariate interpolation of large sets of scattered data
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
New techniques for best-match retrieval
ACM Transactions on Information Systems (TOIS)
K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
On finding the closest bitwise matches in a fixed set
ACM Transactions on Mathematical Software (TOMS)
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Ultra-fast expected time parallel algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
An efficient expected time parallel algorithm for Voronoi construction
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Comments on 'Parallel Algorithms for Hierarchical Clustering and Cluster Validity'
IEEE Transactions on Pattern Analysis and Machine Intelligence
Error free incremental construction of Voronoi diagrams in the plane
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
A comparison of sequential Delaunay triangulation algorithms
Proceedings of the eleventh annual symposium on Computational geometry
Hierarchic document classification using Ward's clustering method
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
Artificial Intelligence Review - Special issue on lazy learning
Bucket-like space partitioning data structures with applications to ray-tracing
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A Simple Algorithm for Nearest Neighbor Search in High Dimensions
IEEE Transactions on Pattern Analysis and Machine Intelligence
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth 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
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Fast linear expected-time alogorithms for computing maxima and convex hulls
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
SCG '85 Proceedings of the first annual symposium on Computational geometry
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
Automatic finite-element mesh generation from geometric models—A point-based approach
ACM Transactions on Graphics (TOG)
Distributed Processing of Similarity Queries
Distributed and Parallel Databases
Exact L∞ nearest neighbor search in high dimensions
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
ACM Computing Surveys (CSUR)
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Low latency photon mapping using block hashing
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Efficient spatial access to a data base
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Using spatial data access structures for filtering nearest neighbor queries
Data & Knowledge Engineering
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Fast Nearest-Neighbor Search in Dissimilarity Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
When Is ''Nearest Neighbor'' Meaningful?
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Training Set Expansion in Handwritten Character Recognition
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
The Idea of De-Clustering and its Applications
VLDB '86 Proceedings of the 12th 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
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Simple termination conditions for k-nearest neighbor method
Pattern Recognition Letters
Clustering in massive data sets
Handbook of massive data sets
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes
Computational Geometry: Theory and Applications
Fast expected-time and approximation algorithms for geometric minimum spanning trees
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The excell method for efficient geometric access to data
DAC '82 Proceedings of the 19th Design Automation Conference
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
Journal of Experimental Algorithmics (JEA)
Expected time analysis for Delaunay point location
Computational Geometry: Theory and Applications
Mobile services discovery and selection in the publish/subscribe paradigm
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
A Unified Framework for Monitoring Data Streams in Real Time
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Modeling and visualization of leaf venation patterns
ACM SIGGRAPH 2005 Papers
On the stabbing number of a random Delaunay triangulation
Computational Geometry: Theory and Applications
GAPS: A clustering method using a new point symmetry-based distance measure
Pattern Recognition
StatStream: statistical monitoring of thousands of data streams in real time
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The Field Representation Language
Journal of Biomedical Informatics
Advanced global illumination using photon mapping
ACM SIGGRAPH 2008 classes
Some Symmetry Based Classifiers
Fundamenta Informaticae
A new point symmetry based fuzzy genetic clustering technique for automatic evolution of clusters
Information Sciences: an International Journal
Probably correct k-nearest neighbor search in high dimensions
Pattern Recognition
SCIA'03 Proceedings of the 13th Scandinavian conference on Image analysis
Comparison of nearest point algorithms by genetic algorithms
Expert Systems with Applications: An International Journal
A rapid algorithm for topology construction from a set of line segments
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
A fast offline building recognition application on a mobile telephone
ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
Constrained delaunay triangulation using delaunay visibility
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
Geometric minimum spanning trees with GEOFILTERKRUSKAL*
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Directed enumeration method in image recognition
Pattern Recognition
Some Symmetry Based Classifiers
Fundamenta Informaticae
Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
Journal of Combinatorial Optimization
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |