7930 search results - page 482 / 1586 » Greedy in Approximation Algorithms |
136
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
160
click to vote
EMO
2003
Springer
16 years 5 days ago
2003
Springer
We present PICPA, a new algorithm for tackling constrained continuous multi-objective problems. The algorithm combines constraint propagation techniques and evolutionary concepts. ...
169
click to vote
PSIVT
2009
Springer
15 years 11 months ago
2009
Springer
This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the a...
196
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
183
click to vote
SSDBM
2005
IEEE
16 years 15 days ago
2005
IEEE
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...