5100 search results - page 374 / 1020 » The Linear Complexity of a Graph |
211
click to vote
ICIP
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...
208
click to vote
ISBI
2009
IEEE
16 years 1 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 ...
229
click to vote
SMA
2009
ACM
16 years 1 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
161
click to vote
COMPGEOM
2004
ACM
16 years 10 days ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
197
click to vote
INFOVIS
2003
IEEE
16 years 5 days ago
2003
IEEE
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...