Sciweavers

442 search results - page 12 / 89
» A Distributed Range Assignment Protocol
Sort
View
ICC
2007
IEEE
115views Communications» more  ICC 2007»
14 years 1 months ago
Distributed Minimum-Cost Clustering Protocol for UnderWater Sensor Networks (UWSNs)
—In this paper, we study the node clustering problem in UnderWater Sensor Networks (UWSNs). We formulate the problem into a cluster-centric cost-based optimization problem with a...
Pu Wang, Cheng Li, Jun Zheng
IJCAI
2007
13 years 8 months ago
An Improved Probabilistic Ant based Clustering for Distributed Databases
In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is ...
Chandrasekar Ramachandran, Thanukrishnan Srinivasa...
ICSE
2008
IEEE-ACM
14 years 8 months ago
Developing a security protocol for a distributed decision support system in a healthcare environment
In this paper, we describe the unique security issues involved in healthcare domains. These have been addressed to the needs of the HealthAgents project. In the proposed approach,...
Liang Xiao 0002, Paul H. Lewis, Alex Gibb
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 8 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
COMPGEOM
2010
ACM
14 years 13 days ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park