The following pages link to (Q3128920):
Displaying 15 items.
- Dimension reduction and construction of feature space for image pattern recognition (Q294416) (← links)
- Decomposable algorithms for nearest neighbor computing (Q436812) (← links)
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- A strong lower bound for approximate nearest neighbor searching (Q834886) (← links)
- Probabilistic proximity searching algorithms based on compact partitions (Q876710) (← links)
- Chromatic nearest neighbor searching: A query sensitive approach (Q1595399) (← links)
- Optimal deterministic algorithm generation (Q1668803) (← links)
- Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. (Q1853173) (← links)
- Accounting for boundary effects in nearest-neighbor searching (Q1923772) (← links)
- Finding Largest Common Point Sets (Q3132918) (← links)
- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces (Q3541079) (← links)
- Topology B-trees and their applications (Q5057450) (← links)
- (Q5115825) (← links)
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees (Q5458545) (← links)
- Efficient image retrieval through vantage objects (Q5952756) (← links)