Sciweavers

4074 search results - page 316 / 815
» Abstract Graph Transformation
Sort
View
ACIVS
2006
Springer
16 years 19 days ago
A Linear-Time Approach for Image Segmentation Using Graph-Cut Measures
Abstract. Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We ...
Alexandre X. Falcão, Paulo A. V. Miranda, A...
TPCG
2003
IEEE
15 years 12 months ago
Guided Navigation in Task-Oriented 3D Graph Visualizations
In many application areas an optimal visualization of a complex graph depends on the specific task to be accomplished by the user. Therefore a means of locally customizable layou...
Guido Reina, Sven Lange-Last, Klaus D. Engel, Thom...
ICALP
2010
Springer
15 years 11 months ago
Dynamic Programming for Graphs on Surfaces
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilik...
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
15 years 11 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
EMMCVPR
2007
Springer
15 years 10 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...