Sciweavers

2137 search results - page 189 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
MOBICOM
2004
ACM
14 years 3 months ago
Initializing newly deployed ad hoc and sensor networks
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ACPC
1999
Springer
14 years 1 months ago
Modeling and Scheduling for MPEG-4 Based Video Encoder Using a Cluster of Workstations
In this paper, we first present an Object Composition Petri Nets (OCPN) based model methodology for describing the dynamic behaviour of the multiple video objects and user interac...
Yong He, Ishfaq Ahmad, Ming L. Liou
PR
2010
156views more  PR 2010»
13 years 8 months ago
The hyperbolic smoothing clustering method
It is considered the minimum sum-of-squares clustering problem. The mathematical modeling of this problem leads to a min − sum − min formulation which, in addition to its intr...
Adilson Elias Xavier
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 10 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
14 years 6 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...