Sciweavers

5889 search results - page 434 / 1178
» Graph Layout Problems
Sort
View
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
16 years 1 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
CVPR
2003
IEEE
16 years 26 days ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
DAGM
2008
Springer
15 years 9 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr
COLING
2008
15 years 9 months ago
Exploiting Graph Structure for Accelerating the Calculation of Shortest Paths in Wordnets
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...
Holger Wunsch
CSJM
2006
76views more  CSJM 2006»
15 years 7 months ago
Graph Coloring using Peer-to-Peer Networks
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
Adrian Iftene, Cornelius Croitoru