1941 search results - page 281 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
JDA
2006
14 years 10 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
113
click to vote
IPSN
2007
Springer
15 years 4 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
DIALM
2007
ACM
15 years 1 months ago
2007
ACM
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
132
click to vote
ESA
2010
Springer
14 years 11 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...