1158 search results - page 89 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
154
click to vote
INFORMS
2000
15 years 5 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
186
click to vote
PAKDD
2009
ACM
16 years 3 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
155
click to vote
IPSN
2007
Springer
16 years 7 days ago
2007
Springer
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
144
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
173
click to vote
RECOMB
2010
Springer
16 years 1 months ago
2010
Springer
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...