37 search results - page 5 / 8 » soda 2000 |
SODA
2000
ACM
13 years 8 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
We consider the problem of restructuring an ordered binary tree T , preserving the in-order sequence of its nodes, so as to reduce its height to some target value h. Such a restru...