Sciweavers

2429 search results - page 155 / 486
» Toposemantic Network Clustering
Sort
View
MOBIHOC
2002
ACM
16 years 6 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
IWOCA
2009
Springer
134views Algorithms» more  IWOCA 2009»
16 years 1 months ago
Combinatorial Models for Cooperation Networks
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
Michael Drmota, Bernhard Gittenberger, Reinhard Ku...
IJCNN
2006
IEEE
16 years 15 days ago
Information Theoretic Angle-Based Spectral Clustering: A Theoretical Analysis and an Algorithm
— Recent work has revealed a close connection between certain information theoretic divergence measures and properties of Mercer kernel feature spaces. Specifically, it has been...
Robert Jenssen, Deniz Erdogmus, Jose C. Principe
CLUSTER
2002
IEEE
15 years 11 months ago
An Extensible, Portable, Scalable Cluster Management Software Architecture
This paper describes an object-oriented software architecture for cluster integration and management that enables extensibility, portability, and scalability. This architecture ha...
James H. Laros III, Lee Ward, Nathan W. Dauchy, Ro...
SOFSEM
2007
Springer
16 years 17 days ago
A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks
We provide the implementation results of the distributed mutual exclusion algorithm based on Ricart-Agrawala algorithm for mobile ad hoc networks (MANETs) using the ns2 simulator d...
Orhan Dagdeviren, Kayhan Erciyes