The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
International Journal of Computer Vision
Approximate closest-point queries in high dimensions
Information Processing Letters
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
Visual learning and recognition of 3-D objects from appearance
International Journal of Computer Vision
Using Discriminant Eigenfeatures for Image Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence
Texture Features for Browsing and Retrieval of Image Data
IEEE Transactions on Pattern Analysis and Machine Intelligence
Nearest neighbor searching and applications
Nearest neighbor searching and applications
Fast parallel similarity search in multimedia databases
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Distance-based indexing for high-dimensional metric spaces
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Nearest neighbor queries in metric spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Simple Algorithm for Nearest Neighbor Search in High Dimensions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Density-based indexing for approximate nearest-neighbor queries
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On the geometry of similarity search: dimensionality curse and concentration of measure
Information Processing Letters
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Feature-Based Retrieval of Similar Shapes
Proceedings of the Ninth International Conference on Data Engineering
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Similarity Search in High Dimensions via Hashing
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Near Neighbor Search in Large Metric Spaces
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Estimating the Selectivity of Spatial Queries Using the `Correlation' Fractal Dimension
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Analysis of n-Dimensional Quadtrees using the Hausdorff Fractal Dimension
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Improved query processing and data representation techniques
Improved query processing and data representation techniques
Searching in metric spaces with user-defined and approximate distances
ACM Transactions on Database Systems (TODS)
On the 'Dimensionality Curse' and the 'Self-Similarity Blessing'
IEEE Transactions on Knowledge and Data Engineering
Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient similarity search and classification via rank aggregation
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Approximate searches: k-neighbors + precision
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Identifying audio clips with RARE
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
Algorithms and applications for answering ranked queries using ranked views
The VLDB Journal — The International Journal on Very Large Data Bases
Probabilistic proximity searching algorithms based on compact partitions
Journal of Discrete Algorithms - SPIRE 2002
Diagonal Ordering: a new approach to high-dimensional KNN processing
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
The Active Vertice method: a performant filtering approach to high-dimensional indexing
Data & Knowledge Engineering
Elastic Translation Invariant Matching of Trajectories
Machine Learning
Accelerating approximate similarity queries using genetic algorithms
Proceedings of the 2005 ACM symposium on Applied computing
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
ACM Transactions on Database Systems (TODS)
Exploring bit-difference for approximate KNN search in high-dimensional databases
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
The VLDB Journal — The International Journal on Very Large Data Bases
High dimensional nearest neighbor searching
Information Systems
Theory of nearest neighbors indexability
ACM Transactions on Database Systems (TODS)
Genetic algorithms for approximate similarity queries
Data & Knowledge Engineering
Finding near neighbors through cluster pruning
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
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
CACS: A Novel Classification Algorithm Based on Concept Similarity
ADMA '07 Proceedings of the 3rd international conference on Advanced Data Mining and Applications
Approximate similarity search: A multi-faceted problem
Journal of Discrete Algorithms
Quality and efficiency in high dimensional nearest neighbor search
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Adapting indexing trees to data distribution in feature spaces
Computer Vision and Image Understanding
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
Efficient and accurate nearest neighbor and closest pair search in high-dimensional space
ACM Transactions on Database Systems (TODS)
A nonparametric outlier detection for effectively discovering top-n outliers from engineering data
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Redundant bit vectors for quickly searching high-dimensional regions
Proceedings of the First international conference on Deterministic and Statistical Methods in Machine Learning
Hi-index | 0.00 |