Pages that link to "Item:Q2830635"
From MaRDI portal
The following pages link to Parallel algorithms for nearest neighbor search problems in high dimensions (Q2830635):
Displaying 4 items.
- Distributed computation of the \textit{k}nn graph for large high-dimensional point sets (Q869400) (← links)
- Concurrent linearizable nearest neighbour search in LockFree-kD-tree (Q2232591) (← links)
- Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases (Q3603019) (← links)
- Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations (Q6114955) (← links)