Pages that link to "Item:Q5307550"
From MaRDI portal
The following pages link to On the Least Cost for Proximity Searching in Metric Spaces (Q5307550):
Displaying 12 items.
- On efficient \( k\)-optimal-location-selection query processing in metric spaces (Q528666) (← links)
- 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)
- Counting distance permutations (Q1013072) (← links)
- Reducing the overhead of the AESA metric-space nearest neighbour searching algorithm (Q1352096) (← links)
- Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. (Q1853173) (← links)
- On reporting the \(L_1\) metric closest pair in a query rectangle (Q2446069) (← links)
- Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) (Q2654256) (← links)
- Pivot selection techniques for proximity searching in metric spaces (Q4418153) (← links)
- Speeding up spatial approximation search in metric spaces (Q5406214) (← links)
- MICAI 2004: Advances in Artificial Intelligence (Q5901928) (← links)
