837 search results - page 128 / 168 » Hard combinators |
143
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
147
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
241
click to vote
SENSYS
2006
ACM
15 years 10 months ago
2006
ACM
From experience with wireless sensor networks it has become apparent that dynamic reprogramming of the sensor nodes is a useful feature. The resource constraints in terms of energ...
118
click to vote
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
145
click to vote
SIGMETRICS
2006
ACM
15 years 10 months ago
2006
ACM
Network calculus is a min-plus system theory which facilitates the efficient derivation of performance bounds for networks of queues. It has successfully been applied to provide e...