730 search results - page 130 / 146 » Combinatorics of Monotone Computations |
122
Voted
VISUALIZATION
2005
IEEE
15 years 7 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...
112
Voted
ECCC
2006
15 years 1 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...
114
click to vote
COMPGEOM
2003
ACM
15 years 7 months 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...
119
click to vote
COMPGEOM
2010
ACM
15 years 6 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...
108
click to vote
RECOMB
1997
Springer
15 years 6 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 ...