121 search results - page 3 / 25 » On the degree distribution of the nodes in increasing trees |
ICDM
2009
IEEE
14 years 9 days ago
2009
IEEE
—We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. The algorithm satisfies a rigorous property of differenti...
DATE
2005
IEEE
2005
IEEE
LORD: A Localized, Reactive and Distributed Protocol for Node Scheduling in Wireless Sensor Networks
13 years 7 months ago
The lifetime of wireless sensor networks can be increased by minimizing the number of active nodes that provide complete coverage, while switching off the rest. In this paper, we ...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
MOBIDE
2010
ACM
13 years 5 months ago
2010
ACM
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
IPPS
2008
IEEE
14 years 2 days ago
2008
IEEE
We present a novel protocol for restructuring a treebased overlay network in response to the workload of the application running over it. Through low-cost restructuring operations...