STOC
2005
ACM
14 years 5 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
SPAA
2005
ACM
14 years 5 months ago
2005
ACM
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
SPAA
2005
ACM
14 years 5 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
SIGECOM
2005
ACM
14 years 5 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
TIME
2005
IEEE
14 years 5 months ago
2005
IEEE
Abstract— We present a specification language and algorithms for the online and offline monitoring of synchronous systems including circuits and embedded systems. Such monitori...
SP
2005
IEEE
14 years 5 months ago
2005
IEEE
We present a distributed algorithm for assembling a proof that a request satisfies an access-control policy expressed in a formal logic, in the tradition of Lampson et al. [16]. ...
NDSS
2005
IEEE
14 years 5 months ago
2005
IEEE
In this paper, we focus on tradeoffs between storage cost and rekeying cost for secure multicast. Specifically, we present a family of algorithms that provide a tradeoff betwee...
ISCC
2005
IEEE
14 years 5 months ago
2005
IEEE
—A framework for designing a family of novel fast CRC generation algorithms is presented. Our algorithms can ideally read arbitrarily large amounts of data at a time, while optim...
INFOCOM
2005
IEEE
14 years 5 months ago
2005
IEEE
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...