961 search results - page 103 / 193 » Significance-Driven Graph Clustering |
149
click to vote
GD
1998
Springer
15 years 8 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
223
click to vote
JPDC
2007
15 years 4 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
134
click to vote
COMGEO
2004
ACM
15 years 4 months ago
2004
ACM
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
146
click to vote
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
Clustering of data has numerous applications and has been studied extensively. It is very important in Bioinformatics and data mining. Though many parallel algorithms have been des...
130
click to vote
DATE
2010
IEEE
15 years 9 months ago
2010
IEEE
—Bug-free first silicon is not guaranteed by the existing pre-silicon verification techniques. To have impeccable products, it is now required to identify any bug as soon as the ...