Sciweavers

1883 search results - page 74 / 377
» Ordered theta graphs
Sort
View
ICCV
2007
IEEE
14 years 9 months ago
LogCut - Efficient Graph Cut Optimization for Markov Random Fields
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
Victor S. Lempitsky, Carsten Rother, Andrew Blake
WADS
2007
Springer
106views Algorithms» more  WADS 2007»
14 years 1 months ago
Maximizing Maximal Angles for Plane Straight-Line Graphs
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, ...
PCM
2004
Springer
103views Multimedia» more  PCM 2004»
14 years 1 months ago
Spectral Coding of Three-Dimensional Mesh Geometry Information Using Dual Graph
In this paper, we propose a new scheme for the geometry coding of three-dimensional (3-D) mesh models using a dual graph. In order to compress the mesh geometry information, we gen...
Sung-Yeol Kim, Seung-Uk Yoon, Yo-Sung Ho
SGAI
2004
Springer
14 years 1 months ago
A combinatorial approach to conceptual graph projection checking
We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relat...
Madalina Croitoru, Ernesto Compatangelo
INFOVIS
2002
IEEE
14 years 21 days ago
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
Yehuda Koren, Liran Carmel, David Harel