730 search results - page 130 / 146 » Combinatorics of Monotone Computations |
VISUALIZATION
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a robust method for 3D reconstruction of closed surfaces from sparsely sampled parallel contours. A solution to this problem is especially important for medical segment...
ECCC
2006
13 years 7 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
COMPGEOM
2003
ACM
14 years 23 days ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
COMPGEOM
2010
ACM
13 years 12 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
RECOMB
1997
Springer
13 years 11 months ago
1997
Springer
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...