Pages that link to "Item:Q1853173"
From MaRDI portal
The following pages link to Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. (Q1853173):
Displaying 10 items.
- Probabilistic proximity searching algorithms based on compact partitions (Q876710) (← links)
- Dynamic detection for computer virus based on immune system (Q954462) (← links)
- Approximate similarity search: a multi-faceted problem (Q1013071) (← links)
- Counting distance permutations (Q1013072) (← links)
- Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions (Q1950389) (← links)
- Maximum-likelihood approximate nearest neighbor method in real-time image recognition (Q2289612) (← links)
- Feature weighting as a tool for unsupervised feature selection (Q2410581) (← links)
- Pivot selection techniques for proximity searching in metric spaces (Q4418153) (← links)
- Thinking Ultrametrically, Thinking p-Adically (Q5270628) (← links)
- On the Least Cost for Proximity Searching in Metric Spaces (Q5307550) (← links)