4009 search results - page 29 / 802 » Clustering on Complex Graphs |
VIZSEC
2004
Springer
15 years 5 months ago
2004
Springer
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
COMBINATORICS
2007
14 years 11 months ago
2007
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
102
click to vote
IJCNN
2000
IEEE
15 years 3 months ago
2000
IEEE
For unsupervised clustering in a network of spiking neurons we develop a temporal encoding of continuously valued data to obtain arbitrary clustering capacity and precision with a...
104
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
NIPS
2008
15 years 1 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...