Sciweavers

3220 search results - page 86 / 644
» Constrained Graph Processes
Sort
View
ACSC
2005
IEEE
15 years 3 months ago
A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
Xiaodi Huang, Peter Eades, Wei Lai
JCT
2008
65views more  JCT 2008»
14 years 9 months ago
Random graphs on surfaces
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...
Colin McDiarmid
IPPS
2007
IEEE
15 years 4 months ago
Analyzing the Scalability of Graph Algorithms on Eldorado
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...
Keith D. Underwood, Megan Vance, Jonathan W. Berry...
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Soft Region Correspondence Estimation for Graph-Theoretic Image Retrieval Using Quadratic Programming Approach
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and tr...
Chuech-Yu Li, Chiou-Ting Hsu
UAI
2008
14 years 11 months ago
Convergent Message-Passing Algorithms for Inference over General Graphs with Convex Free Energies
Inference problems in graphical models can be represented as a constrained optimization of a free energy function. It is known that when the Bethe free energy is used, the fixedpo...
Tamir Hazan, Amnon Shashua