Sciweavers

2137 search results - page 176 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
WAW
2009
Springer
136views Algorithms» more  WAW 2009»
14 years 4 months ago
Permuting Web Graphs
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
CVPR
2008
IEEE
14 years 11 months ago
Interactive image segmentation via minimization of quadratic energies on directed graphs
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
Dheeraj Singaraju, Leo Grady, René Vidal
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 2 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
ICIP
2008
IEEE
14 years 4 months ago
Multi-polarity text segmentation using graph theory
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
Jia Li, YongHong Tian, Tiejun Huang, Wen Gao
CORR
2010
Springer
166views Education» more  CORR 2010»
13 years 9 months ago
The dynamics of message passing on dense graphs, with applications to compressed sensing
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
Mohsen Bayati, Andrea Montanari