Sciweavers

2612 search results - page 193 / 523
» Switching Graphs and Their Complexity
Sort
View
ICIP
2007
IEEE
16 years 6 months ago
Modeling of Front Evolution with Graph Cut Optimization
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...
Hang Chang, Qing Yang, Manfred Auer, Bahram Parvin
ISBI
2009
IEEE
15 years 11 months ago
Structural Annotation of EM Images by Graph Cut
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 ...
Hang Chang, Manfred Auer, Bahram Parvin
182
Voted
SMA
2009
ACM
134views Solid Modeling» more  SMA 2009»
15 years 11 months ago
Exact Delaunay graph of smooth convex pseudo-circles: general predicates, and implementation for ellipses
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...
Ioannis Z. Emiris, Elias P. Tsigaridas, George M. ...
ACSAC
2006
IEEE
15 years 10 months ago
Practical Attack Graph Generation for Network Defense
Attack graphs are a valuable tool to network defenders, illustrating paths an attacker can use to gain access to a targeted network. Defenders can then focus their efforts on patc...
Kyle Ingols, Richard Lippmann, Keith Piwowarski
COMPGEOM
2004
ACM
15 years 10 months ago
Computing the visibility graph of points within a polygon
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...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...