4009 search results - page 164 / 802 » Clustering on Complex Graphs |
126
click to vote
KDD
2002
ACM
16 years 4 months ago
2002
ACM
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
212
click to vote
VLDB
1998
ACM
15 years 8 months ago
1998
ACM
Many applications require the management of spatial data. Clustering large spatial databases is an important problem which tries to find the densely populated regions in the featu...
152
click to vote
MOBIHOC
2001
ACM
16 years 3 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...
141
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....
120
click to vote
RT
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. There has been great success in speeding up global illumination computation in diffuse environments. The concept of clustering allows radiosity computations even for scen...