1133 search results - page 159 / 227 » Basics of Graph Cuts |
137
click to vote
SMA
2003
ACM
15 years 9 months ago
2003
ACM
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
138
click to vote
RTCSA
2000
IEEE
15 years 8 months ago
2000
IEEE
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
131
click to vote
INFOVIS
1999
IEEE
15 years 8 months ago
1999
IEEE
ct Constellation is a visualization system for the results of queries from the MindNet natural language semantic network. Constellation is targeted at helping MindNet's creato...
122
click to vote
VIIP
2001
15 years 5 months ago
2001
Most of the previous multiresolution models use exclusively the triangle graphic primitive both in the data structure and in the rendering stage. Only a few models use another gra...
151
click to vote
JUCS
2006
15 years 3 months ago
2006
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...