Sciweavers

1963 search results - page 149 / 393
» The Maximum Solution Problem on Graphs
Sort
View
MP
2006
84views more  MP 2006»
13 years 10 months ago
On the behavior of the homogeneous self-dual model for conic convex optimization
Abstract. There is a natural norm associated with a starting point of the homogeneous selfdual (HSD) embedding model for conic convex optimization. In this norm two measures of the...
Robert M. Freund
ICS
1993
Tsinghua U.
14 years 2 months ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
ICCV
2007
IEEE
15 years 2 days ago
Introducing Curvature into Globally Optimal Image Segmentation: Minimum Ratio Cycles on Product Graphs
While the majority of competitive image segmentation methods are based on energy minimization, only few allow to efficiently determine globally optimal solutions. A graphtheoretic...
Thomas Schoenemann, Daniel Cremers
AUTOMATICA
2008
116views more  AUTOMATICA 2008»
13 years 10 months ago
A dynamical systems approach to weighted graph matching
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
Michael M. Zavlanos, George J. Pappas
GD
1998
Springer
14 years 2 months ago
Using Graph Layout to Visualize Train Interconnection Data
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
Ulrik Brandes, Dorothea Wagner