7930 search results - page 574 / 1586 » Greedy in Approximation Algorithms |
216
click to vote
WIRN
2005
Springer
16 years 18 days 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...
139
click to vote
COMPUTING
2006
15 years 7 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...
164
click to vote
NA
2007
15 years 6 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 ...
186
click to vote
BIOINFORMATICS
2011
15 years 2 months ago
2011
Motivation: The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both ...
171
click to vote
VLSID
2007
IEEE
16 years 7 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...