185 search results - page 12 / 37 » A Simple Min Cut Algorithm |
139
Voted
ISBI
2009
IEEE
15 years 9 months ago
2009
IEEE
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
99
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
125
Voted
VISUALIZATION
1995
IEEE
15 years 5 months ago
1995
IEEE
We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greed...
112
Voted
CPC
2006
15 years 2 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
115
Voted
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...