Pages that link to "Item:Q3659157"
From MaRDI portal
The following pages link to A Data Structure and an Algorithm for the Nearest Point Problem (Q3659157):
Displaying 10 items.
- Probabilistic proximity searching algorithms based on compact partitions (Q876710) (← links)
- Parallel query processing on distributed clustering indexes (Q1013068) (← links)
- Solving similarity joins and range queries in metric spaces with the list of twin clusters (Q1013069) (← links)
- Exploiting distance coherence to speed up range queries in metric indexes (Q1041769) (← links)
- Distance-based index structures for fast similarity search (Q1709472) (← links)
- A practical approach to the 2D incremental nearest-point problem suitable for different point distributions (Q2459569) (← links)
- Some approaches to improve tree-based nearest neighbour search algorithms (Q2575820) (← links)
- Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) (Q2654256) (← links)
- WINNING ENTRY OF THE K. U. LEUVEN TIME-SERIES PREDICTION COMPETITION (Q3579292) (← links)
- Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers (Q5448646) (← links)
