141 search results - page 10 / 29 » Partitioning Approach to Visualization of Large Graphs |
PAMI
2007
13 years 7 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...
TPCG
2003
IEEE
14 years 23 days ago
2003
IEEE
In many application areas an optimal visualization of a complex graph depends on the specific task to be accomplished by the user. Therefore a means of locally customizable layou...
APVIS
2010
13 years 9 months ago
2010
Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through...
MICCAI
2010
Springer
13 years 6 months ago
2010
Springer
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...