88 search results - page 13 / 18 » The Multidimensional Knapsack Problem: Structure and Algorit... |
SSDBM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract. We propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem in Euclidean spaces. Compared to the limitations of existing methods for ...
GRC
2008
IEEE
13 years 8 months ago
2008
IEEE
Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
BTW
2009
Springer
13 years 10 months ago
2009
Springer
Abstract: Efficient content-based similarity search in large multimedia databases requires efficient query processing algorithms for many practical applications. Especially in hi...
PVLDB
2008
13 years 6 months ago
2008
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the lo...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...