232 search results - page 33 / 47 » Dynamic Graph Clustering Using Minimum-Cut Trees |
CLUSTER
1998
IEEE
13 years 7 months ago
1998
IEEE
In this paper we propose a new multicast protocol for multihop mobile wireless networks. Instead of forming multicast trees, a group of nodes in charge of forwarding multicast pac...
IGIS
1994
13 years 11 months ago
1994
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
In many application areas, for example in design or media production processes, several authors have to work cooperatively on the same project. Thereby, a frequently used data for...
IPL
1998
13 years 7 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...