4110 search results - page 513 / 822 » Efficient algorithms for the 2-gathering problem |
167
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
200
click to vote
TSP
2008
15 years 6 months ago
2008
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
248
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
221
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
183
click to vote
ICIP
2008
IEEE
16 years 8 months ago
2008
IEEE
The problem of efficient video transmission over noisy channels involves good compression rates and robustness in presence of channel failures. The proposed framework of joint sou...