Sciweavers

1949 search results - page 136 / 390
» Random graphs on surfaces
Sort
View
CVPR
2008
IEEE
15 years 4 months ago
Globally optimal surface segmentation using regional properties of segmented objects
Efficient segmentation of globally optimal surfaces in volumetric images is a central problem in many medical image analysis applications. Intra-class variance has been successful...
Xin Dou, Xiaodong Wu, Andreas Wahle, Milan Sonka
145
Voted
ISCIS
2005
Springer
15 years 10 months ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
ACL
2010
15 years 2 months ago
Identifying Text Polarity Using Random Walks
Automatically identifying the polarity of words is a very important task in Natural Language Processing. It has applications in text classification, text filtering, analysis of pr...
Ahmed Hassan, Dragomir R. Radev
CORR
2012
Springer
272views Education» more  CORR 2012»
14 years 7 days ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 11 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...