88 search results - page 10 / 18 » The Multidimensional Knapsack Problem: Structure and Algorit... |
SDM
2012
SIAM
11 years 10 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
CVPR
2010
IEEE
14 years 10 days ago
2010
IEEE
We consider the problem of learning to map between two vector spaces given pairs of matching vectors, one from each space. This problem naturally arises in numerous vision problem...
DASFAA
2008
IEEE
14 years 1 months ago
2008
IEEE
Applications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach t...
NIPS
2004
13 years 8 months ago
2004
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
MOBIHOC
2010
ACM
13 years 5 months ago
2010
ACM
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...