4110 search results - page 515 / 822 » Efficient algorithms for the 2-gathering problem |
286
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
148
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
Efficient search for nearest neighbors (NN) is a fundamental problem arising in a large variety of applications of vast practical interest. In this paper we propose a novel techniq...
184
click to vote
KES
2004
Springer
16 years 1 days ago
2004
Springer
Artificial Intelligence algorithms can be divided into two groups according to the type of problems they solve. Knowledge-intensive domains contain explicit knowledge, whereas know...
276
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
161
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
A multiclass classification problem can be reduced to a collection of binary problems with the aid of a coding matrix. The quality of the final solution, which is an ensemble of b...