Sciweavers

15494 search results - page 393 / 3099
» Computing dynamic clusters
Sort
View
JUCS
2007
164views more  JUCS 2007»
15 years 6 months ago
An Adaptive Hierarchical Extension of DSR: The Cluster Source Routing
: Numerous studies have shown the difficulty for a single routing protocol to scale with respect to mobility and network size in wireless ad hoc networks. This paper presents a clu...
Farid Jaddi, Béatrice Paillassa
CCR
2002
98views more  CCR 2002»
15 years 6 months ago
Efficient flooding with Passive Clustering (PC) in ad hoc networks
An ad hoc network is a fast deployable selfconfiguring wireless network characterized by node mobility, dynamic topology structure, unreliable media and limited power supply. Node...
Taek Jin Kwon, Mario Gerla
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
15 years 5 months ago
CP-index: using clustering and pivots for indexing non-metric spaces
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
Victor Sepulveda, Benjamin Bustos
ICS
2009
Tsinghua U.
16 years 1 months ago
Dynamic topology aware load balancing algorithms for molecular dynamics applications
Molecular Dynamics applications enhance our understanding of biological phenomena through bio-molecular simulations. Large-scale parallelization of MD simulations is challenging b...
Abhinav Bhatele, Laxmikant V. Kalé, Sameer ...
LATIN
2010
Springer
16 years 1 months ago
Kernelization through Tidying
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
René van Bevern, Hannes Moser, Rolf Niederm...