Sciweavers

750 search results - page 51 / 150
» Reconstruction for Models on Random Graphs
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 6 months ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
15 years 1 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
CVIU
2007
113views more  CVIU 2007»
14 years 12 months ago
Primal sketch: Integrating structure and texture
This article proposes a generative image model, which is called ‘‘primal sketch,’’ following Marr’s insight and terminology. This model combines two prominent classes of...
Cheng-en Guo, Song Chun Zhu, Ying Nian Wu
CVPR
2008
IEEE
16 years 1 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
CORR
2010
Springer
79views Education» more  CORR 2010»
14 years 12 months ago
Random Topologies and the emergence of cooperation: the role of short-cuts
We present a detailed study about the role of the short-cuts of a network in promoting the emergence of cooperation in a population of agents playing the Prisoner's Dilemma Ga...
Daniele Vilone, Angel Sánchez, Jesús...