Bayesian Optimization with an Empirical Hardness Model for Approximate Nearest Neighbour Search
Nearest Neighbour Search in high-dimensional spaces is a common problem in Computer Vision. Although no algorithm better than linear search is known, approximate algorithms are commonly used to tackle this problem. The drawback of using such algorithms is that their performance depends highly on par...
| Autors principals: | , , |
|---|---|
| Format: | Conference item |
| Publicat: |
2014
|