1133 search results - page 103 / 227 » Basics of Graph Cuts |
121
click to vote
CAI
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we present an overview of algebraic graph transformation in the double pushout approach. Basic results concerning independence, parallelism, concurrency, embedding, ...
DAM
2000
14 years 9 months ago
2000
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...
ISSTA
2009
ACM
15 years 4 months ago
2009
ACM
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
CGI
1998
IEEE
15 years 2 months ago
1998
IEEE
We present an algorithm for the reconstruction of a surface from an unorganized set of points in space. The point data may be obtained from a laser range scanner or any other digi...
110
click to vote
CVPR
2001
IEEE
15 years 12 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...