Sciweavers

157 search results - page 10 / 32
» Symmetrizations for clustering directed graphs
Sort
View
IPPS
2010
IEEE
13 years 5 months ago
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
Joachim Gehweiler, Henning Meyerhenke
LWA
2007
13 years 8 months ago
Multi-objective Frequent Termset Clustering
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
Andreas Kaspari, Michael Wurst
WWW
2008
ACM
14 years 8 months ago
Graph theoretical framework for simultaneously integrating visual and textual features for efficient web image clustering
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...
Manjeet Rege, Ming Dong, Jing Hua
EUROPAR
2007
Springer
14 years 1 months ago
Acyclic Preference Systems in P2P Networks
In this work we study preference systems suitable for the Peer-to-Peer paradigm. Most of them fall in one of the three following categories: global, symmetric and complementary. Al...
Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabi...
ADHOC
2005
95views more  ADHOC 2005»
13 years 7 months ago
Planar graph routing on geographical clusters
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
Hannes Frey, Daniel Görgen