Sciweavers

141 search results - page 16 / 29
» Partitioning Approach to Visualization of Large Graphs
Sort
View
26
Voted
ICIP
2009
IEEE
13 years 5 months ago
A hierarchical graph-based markovian clustering approach for the unsupervised segmentation of textured color images
In this paper, a new unsupervised hierarchical approach to textured color images segmentation is proposed. To this end, we have designed a two-step procedure based on a grey-scale...
Rachid Hedjam, Max Mignotte
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
14 years 7 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
VLDB
2004
ACM
163views Database» more  VLDB 2004»
14 years 26 days ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
CSREASAM
2006
13 years 9 months ago
A Visual Environment for Characterization of State Changes in Computer Systems
: Traditional state modeling techniques have several limitations. One of these is the reduced ability to model a large number of variables simultaneously. Another limitation is tha...
Gregory Vert, Sergiu M. Dascalu, Frederick C. Harr...