3894 search results - page 403 / 779 » Approximation Algorithms for Biclustering Problems |
124
click to vote
CORR
2004
Springer
15 years 4 months ago
2004
Springer
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
130
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...
146
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
144
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
125
Voted
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
— This study introduces the multi-criteria approach to the optimization of dynamic molecular alignment by shaped femtosecond laser pulses, which has been considered so far only a...