7006 search results - page 430 / 1402 » Approximation Algorithms |
160
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
143
Voted
IPL
2008
15 years 4 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
172
click to vote
WIRN
2005
Springer
15 years 10 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
103
click to vote
COMPUTING
2006
15 years 5 months ago
2006
The ULV decomposition (ULVD) is an important member of a class of rank-revealing two-sided orthogonal decompositions used to approximate the singular value decomposition (SVD). Th...
125
click to vote
NA
2007
15 years 4 months ago
2007
Abstract. OPED is a new image reconstruction algorithm based on orthogonal polynomial expansion on the disk. We show that the integral of the approximation function in OPED can be ...