503 search results - page 23 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
129
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
136
Voted
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
117
Voted
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
139
click to vote
ICIP
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper addresses the shape-based segmentation problem using level sets. In particular, we propose a fast algorithm to solve the piece-wise constant Chan-Vese segmentation mode...
153
Voted
WDAG
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...