On the public citation graph
Searching in metric spaces by spatial approximation
0 signed · 257 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-44808-x_12openalex-snapshot
A Probabilistic Spell for the Curse of Dimensionality
inferredcites →https://doi.org/10.1007/3-540-55488-2_27openalex-snapshot
Monotonous Bisector* Trees — a tool for efficient partitioning of complex scenes of geometric objects
inferredcites →https://doi.org/10.1007/3-540-58094-8_18openalex-snapshot
Proximity matching using fixed-queries trees
inferredcites →https://doi.org/10.1016/0020-0190(91)90074-ropenalex-snapshot
Satisfying general proximity / similarity queries with metric trees
inferredcites →https://doi.org/10.1016/0167-8655(86)90013-9openalex-snapshot
An algorithm for finding nearest neighbours in (approximately) constant average time
inferredcites →https://doi.org/10.1016/0167-8655(94)90095-7openalex-snapshot
A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements
inferredcites →https://doi.org/10.1016/0167-8655(96)00032-3openalex-snapshot
A fast branch & bound nearest neighbour classifier in metric spaces
inferredcites →https://doi.org/10.1016/0306-4379(87)90041-xopenalex-snapshot
Voronoi trees and clustering problems
inferredcites →https://doi.org/10.1023/a:1011343115154openalex-snapshot
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
inferredcites →https://doi.org/10.1109/34.615448openalex-snapshot
A simple algorithm for nearest neighbor search in high dimensions
inferredcites →https://doi.org/10.1109/sccc.2001.972650openalex-snapshot
Dynamic spatial approximation trees
inferredcites →https://doi.org/10.1109/spire.1999.796576openalex-snapshot
Spaghettis: an array based algorithm for similarity queries in metric spaces
inferredcites →https://doi.org/10.1109/spire.1999.796589openalex-snapshot
Searching in metric spaces by spatial approximation
inferredcites →https://doi.org/10.1109/spire.2000.878182openalex-snapshot
An effective clustering algorithm to index high dimensional metric spaces
inferredcites →https://doi.org/10.1109/tse.1979.234200openalex-snapshot
Multidimensional Binary Search Trees in Database Applications
inferredcites →https://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferredcites →https://doi.org/10.1145/253260.253345openalex-snapshot
Distance-based indexing for high-dimensional metric spaces
inferredcites →https://doi.org/10.1145/320248.320255openalex-snapshot
Distance browsing in spatial databases
inferredcites →https://doi.org/10.1145/359581.359599openalex-snapshot
The choice of reference points in best-match file searching
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.1145/362003.362025openalex-snapshot
Some approaches to best-match file searching
inferredcites →https://doi.org/10.1145/375360.375365openalex-snapshot
A guided tour to approximate string matching
inferredcites →https://doi.org/10.5555/313559.313789openalex-snapshot
Data structures and algorithms for nearest neighbor search in general metric spaces
inferredcites →https://doi.org/10.5555/338219.338273openalex-snapshot
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11428831_125openalex-snapshot
Efficient Parallelization of Spatial Approximation Trees
inferred← citeshttps://doi.org/10.1007/11579427_41openalex-snapshot
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
inferred← citeshttps://doi.org/10.1007/11758501_82openalex-snapshot
An Index Data Structure for Searching in Metric Space Databases
inferred← citeshttps://doi.org/10.1007/11795131_64openalex-snapshot
A Bottom-Up Distance-Based Index Tree for Metric Space
inferred← citeshttps://doi.org/10.1007/3-540-45735-6_23openalex-snapshot
Fully Dynamic Spatial Approximation Trees
inferred← citeshttps://doi.org/10.1007/3-540-45735-6_25openalex-snapshot
Probabilistic Proximity Searching Algorithms Based on Compact Partitions
inferred← citeshttps://doi.org/10.1007/978-1-4471-4555-4_3openalex-snapshot
Multimedia Indexing, Search, and Retrieval in Large Databases of Social Networks
inferred← citeshttps://doi.org/10.1007/978-1-4614-2110-8_5openalex-snapshot
Similarity Search in Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-1-4614-5076-4_3openalex-snapshot
Computing Voronoi Adjacencies in High Dimensional Spaces by Using Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-02224-2_2openalex-snapshot
Performance Analysis of Graph-Based Methods for Exact and Approximate Similarity Search in Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-05054-2_23openalex-snapshot
A Clustering Algorithm of High-Dimensional Data Based on Sequential Psim Matrix and Differential Truncation
inferred← citeshttps://doi.org/10.1007/978-3-030-32047-8_13openalex-snapshot
Indexability-Based Dataset Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-030-32047-8_7openalex-snapshot
Pruning Algorithms for Low-Dimensional Non-metric k-NN Search: A Case Study
inferred← citeshttps://doi.org/10.1007/978-3-030-48325-8_17openalex-snapshot
MeTree: A Metric Spatial Index
inferred← citeshttps://doi.org/10.1007/978-3-030-54832-2_9openalex-snapshot
Towards Proximity Graph Auto-configuration: An Approach Based on Meta-learning
inferred← citeshttps://doi.org/10.1007/978-3-030-60936-8_10openalex-snapshot
Metrics and Ambits and Sprawls, Oh My
inferred← citeshttps://doi.org/10.1007/978-3-030-60936-8_21openalex-snapshot
Reverse k-Nearest Neighbors Centrality Measures and Local Intrinsic Dimension
inferred← citeshttps://doi.org/10.1007/978-3-030-89657-7_3openalex-snapshot
A Triangle Inequality for Cosine Similarity
inferred← citeshttps://doi.org/10.1007/978-3-031-34147-2_12openalex-snapshot
Dynamic Distal Spatial Approximation Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-46994-7_1openalex-snapshot
Finding HSP Neighbors via an Exact, Hierarchical Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-46994-7_21openalex-snapshot
Overview of the SISAP 2023 Indexing Challenge
inferred← citeshttps://doi.org/10.1007/978-3-031-75823-2_25openalex-snapshot
Top-Down Construction of Locally Monotonic Graphs for Similarity Search
inferred← citeshttps://doi.org/10.1007/978-3-032-06069-3_33openalex-snapshot
Overview of the SISAP 2025 Indexing Challenge
inferred← citeshttps://doi.org/10.1007/978-3-319-05810-8_10openalex-snapshot
On Data Partitioning in Tree Structure Metric-Space Indexes
inferred← citeshttps://doi.org/10.1007/978-3-319-11988-5_6openalex-snapshot
Faster Proximity Searching with the Distal SAT
inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_1556openalex-snapshot
Foundations of Nearest Neighbor Queries in Euclidean Space
inferred← citeshttps://doi.org/10.1007/978-3-319-23201-0_16openalex-snapshot
MLES: Multilayer Exploration Structure for Multimedia Exploration
inferred← citeshttps://doi.org/10.1007/978-3-319-23519-6_1556-1openalex-snapshot
Foundations of Nearest Neighbor Queries in Euclidean Space
inferred← citeshttps://doi.org/10.1007/978-3-319-25087-8_15openalex-snapshot
Evaluating Multilayer Multimedia Exploration
inferred← citeshttps://doi.org/10.1007/978-3-319-46759-7openalex-snapshot
Similarity Search and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-46759-7_2openalex-snapshot
Pruned Bi-directed K-nearest Neighbor Graph for Proximity Search
inferred← citeshttps://doi.org/10.1007/978-3-319-46759-7_5openalex-snapshot
Reference Point Hyperplane Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-68474-1_15openalex-snapshot
Self-indexed Motion Planning
inferred← citeshttps://doi.org/10.1007/978-3-319-96893-3_24openalex-snapshot
Aggregate k Nearest Neighbor Queries in Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-540-30542-2_57openalex-snapshot
Indexing Issues in Supporting Similarity Searching
inferred← citeshttps://doi.org/10.1007/978-3-540-69384-0_38openalex-snapshot
Hybrid Index for Metric Space Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-71661-7_9openalex-snapshot
A Content–Addressable Network for Similarity Search in Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-540-85451-7_92openalex-snapshot
A Search Engine Index for Multimedia Content
inferred← citeshttps://doi.org/10.1007/978-3-540-85654-2_7openalex-snapshot
HRG: A Graph Structure for Fast Similarity Search in Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-540-89689-0_96openalex-snapshot
A Pruning Rule Based on a Distance Sparse Table for Hierarchical Similarity Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-02172-5openalex-snapshot
Pattern Recognition and Image Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-02172-5_52openalex-snapshot
Experimental Analysis of Insertion Costs in a Naïve Dynamic MDF-Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-03625-5_9openalex-snapshot
The Basic Principles of Metric Indexing
inferred← citeshttps://doi.org/10.1007/978-3-642-12189-0_22openalex-snapshot
Accelerating Video Identification by Skipping Queries with a Compact Metric Cache
inferred← citeshttps://doi.org/10.1007/978-3-642-14355-7_25openalex-snapshot
Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive
inferred← citeshttps://doi.org/10.1007/978-3-642-14980-1_7openalex-snapshot
Combining Elimination Rules in Tree-Based Nearest Neighbor Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-15251-1_10openalex-snapshot
Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes
inferred← citeshttps://doi.org/10.1007/978-3-642-15992-3_29openalex-snapshot
Navigating K-Nearest Neighbor Graphs to Solve Nearest Neighbor Searches
inferred← citeshttps://doi.org/10.1007/978-3-642-21928-3_45openalex-snapshot
A GPU-Based Implementation for Range Queries on Spaghettis Data Structure
inferred← citeshttps://doi.org/10.1007/978-3-642-32153-5_10openalex-snapshot
Scalable Distributed Algorithm for Approximate Nearest Neighbor Search Problem in High Dimensional General Metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-32153-5_6openalex-snapshot
Efficient Similarity Search in Metric Spaces with Cluster Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-32153-5_8openalex-snapshot
Static-to-Dynamic Transformation for Metric Indexing Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-32153-5_9openalex-snapshot
DSACL+-tree: A Dynamic Data Structure for Similarity Search in Secondary Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-41062-8_12openalex-snapshot
Extreme Pivots for Faster Metric Indexes
inferred← citeshttps://doi.org/10.1007/978-3-642-41062-8_3openalex-snapshot
Rank Cover Trees for Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/978-3-642-41062-8_30openalex-snapshot
(Very) Fast (All) k-Nearest Neighbors in Metric and Non Metric Spaces without Indexing
inferred← citeshttps://doi.org/10.1007/978-3-642-41062-8_31openalex-snapshot
On Scalable Approximate Search with the Signature Quadratic Form Distance
inferred← citeshttps://doi.org/10.1007/978-981-15-2205-5_8openalex-snapshot
An Architecture for e-Health Recommender Systems Based on Similarity of Patients’ Symptoms
inferred← citeshttps://doi.org/10.1007/s00453-012-9638-2openalex-snapshot
Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions
inferred← citeshttps://doi.org/10.1007/s00778-024-00864-xopenalex-snapshot
Survey of vector database management systems
inferred← citeshttps://doi.org/10.1007/s10044-020-00946-wopenalex-snapshot
A scalable solution to the nearest neighbor search problem through local-search methods on neighbor graphs
inferred← citeshttps://doi.org/10.1007/s10115-019-01423-5openalex-snapshot
Extreme pivots: a pivot selection strategy for faster metric search
inferred← citeshttps://doi.org/10.1007/s10207-012-0158-5openalex-snapshot
Efficient microaggregation techniques for large numerical data volumes
inferred← citeshttps://doi.org/10.1007/s10479-015-1956-8openalex-snapshot
Nearest neighbors methods for support vector machines
inferred← citeshttps://doi.org/10.1007/s10559-017-9966-yopenalex-snapshot
Distance-Based Index Structures for Fast Similarity Search
inferred← citeshttps://doi.org/10.1007/s10588-018-9272-xopenalex-snapshot
XM-tree: data driven computational model by using metric extended nodes with non-overlapping in high-dimensional metric spaces
inferred← citeshttps://doi.org/10.1007/s10618-021-00751-xopenalex-snapshot
Efficient set-valued prediction in multi-class classification
inferred← citeshttps://doi.org/10.1007/s11042-008-0226-zopenalex-snapshot
Improving the space cost of k-NN search in metric spaces by using distance estimators
inferred← citeshttps://doi.org/10.1007/s11042-016-4152-1openalex-snapshot
Large-scale high-dimensional indexing by sparse hashing with l 0 approximation
inferred← citeshttps://doi.org/10.1007/s11227-017-2207-3openalex-snapshot
A graph-based cache for large-scale similarity search engines
inferred← citeshttps://doi.org/10.1007/s11390-008-9151-xopenalex-snapshot
Continually Answering Constraint k-NN Queries in Unstructured P2P Systems
inferred← citeshttps://doi.org/10.1007/s11634-023-00548-4openalex-snapshot
A topological data analysis based classifier
inferred← citeshttps://doi.org/10.1007/s11704-016-5003-yopenalex-snapshot
A parallel computing framework for big data
inferred← citeshttps://doi.org/10.1007/s42979-022-01502-5openalex-snapshot
Extending the Bag Distance for String Similarity Search
inferred← citeshttps://doi.org/10.1016/b978-012088469-8.50070-xopenalex-snapshot
On The Marriage of Lp-norms and Edit Distance
inferred← citeshttps://doi.org/10.1016/j.amc.2018.01.028openalex-snapshot
Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances
inferred← citeshttps://doi.org/10.1016/j.cviu.2016.07.011openalex-snapshot
Pair-wisely optimized clustering tree for feature indexing
inferred← citeshttps://doi.org/10.1016/j.datak.2007.06.001openalex-snapshot
CM-tree: A dynamic clustered index for similarity search in metric databases
inferred← citeshttps://doi.org/10.1016/j.is.2010.10.002openalex-snapshot
Metric Index: An efficient and scalable solution for precise and approximate similarity search
inferred← citeshttps://doi.org/10.1016/j.is.2011.01.002openalex-snapshot
Fully dynamic metric access methods based on hyperplane partitioning
inferred← citeshttps://doi.org/10.1016/j.is.2013.08.002openalex-snapshot
Static-to-dynamic transformation for metric indexing structures (extended version)
inferred← citeshttps://doi.org/10.1016/j.is.2013.10.006openalex-snapshot
Approximate nearest neighbor algorithm based on navigable small world graphs
inferred← citeshttps://doi.org/10.1016/j.is.2015.02.001openalex-snapshot
Near neighbor searching with K nearest references
inferred← citeshttps://doi.org/10.1016/j.is.2015.10.014openalex-snapshot
Faster proximity searching with the distal SAT
inferred← citeshttps://doi.org/10.1016/j.is.2016.03.003openalex-snapshot
Singleton indexes for nearest neighbor search
inferred← citeshttps://doi.org/10.1016/j.is.2016.03.009openalex-snapshot
New dynamic metric indices for secondary memory
inferred← citeshttps://doi.org/10.1016/j.is.2016.06.004openalex-snapshot
An empirical evaluation of intrinsic dimension estimators
inferred← citeshttps://doi.org/10.1016/j.is.2019.04.011openalex-snapshot
Self-indexed motion planning
inferred← citeshttps://doi.org/10.1016/j.is.2020.101507openalex-snapshot
A survey on graph-based methods for similarity searches in metric spaces
inferred← citeshttps://doi.org/10.1016/j.is.2022.102123openalex-snapshot
A meta-learning configuration framework for graph-based similarity search indexes
inferred← citeshttps://doi.org/10.1016/j.is.2025.102565openalex-snapshot
Finding HSP neighbors via an exact, hierarchical approach
inferred← citeshttps://doi.org/10.1016/j.is.2026.102812openalex-snapshot
Graft: Navigable graphs grown on spatial-approximation rootstock
inferred← citeshttps://doi.org/10.1016/j.jda.2008.09.010openalex-snapshot
Parallel query processing on distributed clustering indexes
inferred← citeshttps://doi.org/10.1016/j.jda.2008.09.012openalex-snapshot
Solving similarity joins and range queries in metric spaces with the list of twin clusters
inferred← citeshttps://doi.org/10.1016/j.jda.2011.10.002openalex-snapshot
Indexability, concentration, and VC theory
inferred← citeshttps://doi.org/10.1016/j.jda.2011.10.004openalex-snapshot
Pivot selection: Dimension reduction for distance-based indexing
inferred← citeshttps://doi.org/10.1016/j.jda.2012.07.004openalex-snapshot
Modelling efficient novelty-based search result diversification in metric spaces
inferred← citeshttps://doi.org/10.1016/j.knosys.2021.107305openalex-snapshot
Two-stage routing with optimized guided search and greedy algorithm on proximity graph
inferred← citeshttps://doi.org/10.1016/j.mcm.2006.12.035openalex-snapshot
Generalizing the k -Windows clustering algorithm in metric spaces
inferred← citeshttps://doi.org/10.1016/j.patrec.2004.11.014openalex-snapshot
A compact space decomposition for effective metric indexing
inferred← citeshttps://doi.org/10.1016/j.patrec.2012.01.016openalex-snapshot
A log square average case algorithm to make insertions in fast similarity search
inferred← citeshttps://doi.org/10.1016/s0167-8655(03)00122-3openalex-snapshot
Improved search heuristics for the sa-tree
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00067-4openalex-snapshot
Probabilistic proximity searching algorithms based on compact partitions
inferred← citeshttps://doi.org/10.1049/iet-ipr:20060315openalex-snapshot
Advanced indexing schema for imaging applications: three case studies
inferred← citeshttps://doi.org/10.1109/access.2019.2930753openalex-snapshot
Efficient Similarity Search on Quasi-Metric Graphs
inferred← citeshttps://doi.org/10.1109/acie64499.2025.00026openalex-snapshot
Hybrid Query of Boolean Filter and Vector Similarity Search: Benchmark, Comparison and Direction
inferred← citeshttps://doi.org/10.1109/bigdata.2014.7004283openalex-snapshot
The Adaptive Projection Forest: Using adjustable exclusion and parallelism in metric space indexes
inferred← citeshttps://doi.org/10.1109/cbd.2013.20openalex-snapshot
Large Scale Nearest Neighbors Search Based on Neighborhood Graph
inferred← citeshttps://doi.org/10.1109/cbmi.2011.5972533openalex-snapshot
Efficient indexing structures for fast media search and browsing
inferred← citeshttps://doi.org/10.1109/ccece.2004.1347728openalex-snapshot
Analysis of distance based indexing methods for similarity search
inferred← citeshttps://doi.org/10.1109/cluster49012.2020.00040openalex-snapshot
Fast Scalable Approximate Nearest Neighbor Search for High-dimensional Data
inferred← citeshttps://doi.org/10.1109/icassp.2009.4959788openalex-snapshot
MOBHRG: Fast k-nearest-neighbor search by overlap reduction of hyperspherical regions
inferred← citeshttps://doi.org/10.1109/icde.2005.125openalex-snapshot
Robust Identification of Fuzzy Duplicates
inferred← citeshttps://doi.org/10.1109/icde.2005.66openalex-snapshot
Fast Approximate Similarity Search in Extremely High-Dimensional Data Sets
inferred← citeshttps://doi.org/10.1109/icde.2015.7113317openalex-snapshot
Efficient metric indexing for similarity search
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00326openalex-snapshot
HJG: An Effective Hierarchical Joint Graph for ANNS in Multi-Metric Spaces
inferred← citeshttps://doi.org/10.1109/icdew.2008.4498354openalex-snapshot
Anytime k-nearest neighbor search for database applications
inferred← citeshttps://doi.org/10.1109/iceee.2011.6106649openalex-snapshot
Reaching near neighbors with far and random proxies
inferred← citeshttps://doi.org/10.1109/icime.2009.12openalex-snapshot
Similarity-based Retrieval in High Dimensional Data with Recursive Lists of Clusters: A Study Case with Natural Language Dictionaries
inferred← citeshttps://doi.org/10.1109/icnas.2019.8807848openalex-snapshot
Big IoT Data Indexing: Architecture, Techniques and Open Research Challenges
inferred← citeshttps://doi.org/10.1109/icpr.2002.1047852openalex-snapshot
Metric-based shape retrieval in large databases
inferred← citeshttps://doi.org/10.1109/icpr.2014.657openalex-snapshot
Dynamic Insertions in TLAESA Fast NN Search Algorithm
inferred← citeshttps://doi.org/10.1109/ictta.2006.1684880openalex-snapshot
A Bottom-up Distance-based index Tree for Metric Space
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10228941openalex-snapshot
Prophet: An Efficient Feature Indexing Mechanism for Similarity Data Sharing at Network Edge
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639313openalex-snapshot
Distributed antipole clustering for efficient data search and management in Euclidean and metric spaces
inferred← citeshttps://doi.org/10.1109/iscis.2007.4456857openalex-snapshot
Range queries in natural language dictionaries with recursive lists of clusters
inferred← citeshttps://doi.org/10.1109/ism.2006.137openalex-snapshot
Similarity Search Using Sparse Pivots for Efficient Multimedia Information Retrieval
inferred← citeshttps://doi.org/10.1109/pdp.2008.73openalex-snapshot
Distributed Sparse Spatial Selection Indexes
inferred← citeshttps://doi.org/10.1109/qest.2004.20openalex-snapshot
Spatial Approximation + Sequential Scan = Efficient Metric Indexing
inferred← citeshttps://doi.org/10.1109/sccc.2001.972650openalex-snapshot
Dynamic spatial approximation trees
inferred← citeshttps://doi.org/10.1109/sccc.2003.1245441openalex-snapshot
Improved deletions in dynamic spatial approximation trees
inferred← citeshttps://doi.org/10.1109/sccc.2009.23openalex-snapshot
Delayed Insertion Strategies in Dynamic Metric Indexes
inferred← citeshttps://doi.org/10.1109/sibgrapi67909.2025.11223396openalex-snapshot
Graph-Based Indexing for Fingerprint Identification Systems
inferred← citeshttps://doi.org/10.1109/sisap.2008.11openalex-snapshot
Anytime K-Nearest Neighbor Search for Database Applications
inferred← citeshttps://doi.org/10.1109/sisap.2008.9openalex-snapshot
Similarity Searching: Towards Bulk-Loading Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/sisap.2009.12openalex-snapshot
Speeding Up Permutation Based Indexing with Indexing
inferred← citeshttps://doi.org/10.1109/sisap.2009.17openalex-snapshot
Analyzing Metric Space Indexes: What For?
inferred← citeshttps://doi.org/10.1109/sisap.2009.20openalex-snapshot
EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory
inferred← citeshttps://doi.org/10.1109/sisap.2009.26openalex-snapshot
Metric Index: An Efficient and Scalable Solution for Similarity Search
inferred← citeshttps://doi.org/10.1109/sisap.2009.28openalex-snapshot
Dynamic Spatial Approximation Trees for Massive Data
inferred← citeshttps://doi.org/10.1109/sisap.2009.31openalex-snapshot
Combinatorial Framework for Similarity Search
inferred← citeshttps://doi.org/10.1109/spire.1999.796576openalex-snapshot
Spaghettis: an array based algorithm for similarity queries in metric spaces
inferred← citeshttps://doi.org/10.1109/spire.2000.878182openalex-snapshot
An effective clustering algorithm to index high dimensional metric spaces
inferred← citeshttps://doi.org/10.1109/sws.2011.6101281openalex-snapshot
Multivariate regression for pivot selection: A preliminary study
inferred← citeshttps://doi.org/10.1109/tcbb.2008.99openalex-snapshot
Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations
inferred← citeshttps://doi.org/10.1109/tkde.2005.53openalex-snapshot
Antipole tree indexing to support range search and k-nearest neighbor search in metric spaces
inferred← citeshttps://doi.org/10.1109/tkde.2015.2506556openalex-snapshot
Efficient Metric Indexing for Similarity Search and Similarity Joins
inferred← citeshttps://doi.org/10.1109/tkde.2019.2909204openalex-snapshot
Approximate Nearest Neighbor Search on High Dimensional Data — Experiments, Analyses, and Improvement
inferred← citeshttps://doi.org/10.1109/tkde.2024.3381111openalex-snapshot
DForest: A Minimal Dimensionality-Aware Indexing for High-Dimensional Exact Similarity Search
inferred← citeshttps://doi.org/10.1109/tkde.2024.3487759openalex-snapshot
DIMS: Distributed Index for Similarity Search in Metric Spaces
inferred← citeshttps://doi.org/10.1109/tmm.2013.2247989openalex-snapshot
MSIDX: Multi-Sort Indexing for Efficient Content-Based Image Search and Retrieval
inferred← citeshttps://doi.org/10.1109/tnet.2022.3217012openalex-snapshot
Ascent Similarity Caching With Approximate Indexes
inferred← citeshttps://doi.org/10.1109/tnet.2024.3465844openalex-snapshot
KMSharing: The Framework and Space Abstraction for Efficient Data Sharing at the Network Edge
inferred← citeshttps://doi.org/10.1109/tnet.2024.3473853openalex-snapshot
Optimal Indexing: An Efficient Feature-Based Indexing Framework for Similarity Data Sharing at the Network Edge
inferred← citeshttps://doi.org/10.1109/tpami.2007.1182openalex-snapshot
K-Nearest Neighbor Finding Using MaxNearestDist
inferred← citeshttps://doi.org/10.1109/tpami.2007.70815openalex-snapshot
Effective Proximity Retrieval by Ordering Permutations
inferred← citeshttps://doi.org/10.1109/tpami.2013.125openalex-snapshot
Trinary-Projection Trees for Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1109/tpami.2014.2343223openalex-snapshot
Rank-Based Similarity Search: Reducing the Dimensional Dependence
inferred← citeshttps://doi.org/10.1109/tpami.2018.2889473openalex-snapshot
Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs
inferred← citeshttps://doi.org/10.1142/s0219720009003996openalex-snapshot
CONSTANT TIME CLASH DETECTION IN PROTEIN FOLDING
inferred← citeshttps://doi.org/10.1145/1227161.1322337openalex-snapshot
Dynamic spatial approximation trees
inferred← citeshttps://doi.org/10.1145/1862344.1862346openalex-snapshot
Indexability, concentration, and VC theory
inferred← citeshttps://doi.org/10.1145/1862344.1862351openalex-snapshot
Enlarging nodes to improve dynamic spatial approximation trees
inferred← citeshttps://doi.org/10.1145/1966865.1966873openalex-snapshot
Empirical evaluation of excluded middle vantage point forest on biological sequences workload
inferred← citeshttps://doi.org/10.1145/1995412.1995419openalex-snapshot
Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions
inferred← citeshttps://doi.org/10.1145/2064730.2064736openalex-snapshot
Approximate distributed metric-space search
inferred← citeshttps://doi.org/10.1145/2393347.2393378openalex-snapshot
Query-driven iterated neighborhood graph search for large scale indexing
inferred← citeshttps://doi.org/10.1145/3447548.3470811openalex-snapshot
High-Dimensional Similarity Query Processing for Data Science
inferred← citeshttps://doi.org/10.1145/3511808.3557098openalex-snapshot
Approximate Nearest Neighbor Search under Neural Similarity Metric for Large-Scale Recommendation
inferred← citeshttps://doi.org/10.1145/3534963openalex-snapshot
Indexing Metric Spaces for Exact Similarity Search
inferred← citeshttps://doi.org/10.1145/3588715openalex-snapshot
LiteHST: A Tree Embedding based Method for Similarity Search
inferred← citeshttps://doi.org/10.1145/3626246.3654691openalex-snapshot
Vector Database Management Techniques and Systems
inferred← citeshttps://doi.org/10.1145/3652583.3658117openalex-snapshot
An Exploration Graph with Continuous Refinement for Efficient Multimedia Retrieval
inferred← citeshttps://doi.org/10.1145/3654923openalex-snapshot
ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data
inferred← citeshttps://doi.org/10.1145/3698814openalex-snapshot
iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3709729openalex-snapshot
Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1145/3711896.3736997openalex-snapshot
Hi-PNG: Efficient Interval-Filtering ANNS via Hierarchical Interval Partition Navigating Graph
inferred← citeshttps://doi.org/10.1145/3725333openalex-snapshot
PDX: A Data Layout for Vector Similarity Search
inferred← citeshttps://doi.org/10.1145/3786652openalex-snapshot
FlashANNS: GPU-Driven Asynchronous I/O Pipelining for Eliminating Storage-Compute Bottlenecks in Billion-Scale Similarity Search
inferred← citeshttps://doi.org/10.1145/872757.872796openalex-snapshot
Robust and efficient fuzzy match for online data cleaning
inferred← citeshttps://doi.org/10.1145/958942.958948openalex-snapshot
Index-driven similarity search in metric spaces (Survey Article)
inferred← citeshttps://doi.org/10.11606/d.55.2004.tde-27072004-141623openalex-snapshot
DBM-tree: método de acesso métrico sensível à densidade local
inferred← citeshttps://doi.org/10.11606/d.55.2008.tde-01042008-101843openalex-snapshot
Suporte a consultas por similaridade unárias em SQL
inferred← citeshttps://doi.org/10.11606/d.55.2011.tde-22112011-132339openalex-snapshot
Soluções aproximadas para algoritmos escaláveis de mineração de dados em domínios de dados complexos usando GPGPU
inferred← citeshttps://doi.org/10.11606/t.18.2007.tde-04042008-143239openalex-snapshot
MFIS: algoritmo de reconhecimento e indexação em base de dados de impressões digitais em espaço métrico
inferred← citeshttps://doi.org/10.11606/t.55.2004.tde-20082015-105153openalex-snapshot
Recuperação de informação por similaridade utilizando técnicas inteligentes
inferred← citeshttps://doi.org/10.1186/1471-2105-15-s7-s1openalex-snapshot
ADaM: augmenting existing approximate fast matching algorithms with efficient and exact range queries
inferred← citeshttps://doi.org/10.1186/s13636-017-0123-3openalex-snapshot
Clustering algorithm for audio signals based on the sequential Psim matrix and Tabu Search
inferred← citeshttps://doi.org/10.12785/amis/071l29openalex-snapshot
Isomorphism Distance in Multidimensional Time Series and Similarity Search
inferred← citeshttps://doi.org/10.13140/rg.2.1.3046.1283openalex-snapshot
Growing homophilic networks are natural optimal navigable small worlds
inferred← citeshttps://doi.org/10.1371/journal.pone.0158162openalex-snapshot
Growing Homophilic Networks Are Natural Navigable Small Worlds
inferred← citeshttps://doi.org/10.14778/3368289.3368303openalex-snapshot
Return of the Lernaean Hydra
inferred← citeshttps://doi.org/10.14778/3415478.3415564openalex-snapshot
Similarity query processing for high-dimensional data
showing the first 200 of 231 · page through all 231
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.