141 search results - page 16 / 29 » Partitioning Approach to Visualization of Large Graphs |
156
click to vote
ICIP
2009
IEEE
15 years 2 months ago
2009
IEEE
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...
193
click to vote
ICDM
2006
IEEE
15 years 11 months ago
2006
IEEE
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...
321
click to vote
SIGMOD
2008
ACM
16 years 5 months ago
2008
ACM
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...
133
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
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...
131
Voted
CSREASAM
2006
15 years 6 months ago
2006
: 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...