961 search results - page 88 / 193 » Significance-Driven Graph Clustering |
103
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
d Abstract] Christian Borgs Jennifer Chayes Mohammad Mahdian Amin Saberi We propose to use the community structure of Usenet for organizing and retrieving the information stored i...
155
click to vote
MOBIHOC
2001
ACM
16 years 4 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
146
click to vote
APVIS
2001
15 years 5 months ago
2001
This paper demonstrates the application of graph drawing and information visualisation techniques to the visualisation of information which can be modelled as an attributed graph....
139
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
By the term "quantization", we refer to the process of using quantum mechanics in order to improve a classical algorithm, usually by making it go faster. In this paper, ...
HT
1997
ACM
15 years 8 months ago
1997
ACM
A large hypertext net with node-to-node links can be interesting as a system of unities of meaning formed by node clusters, such that nodes in each of them are orderable into a co...