2252 search results - page 184 / 451 » Lower Bounds for Dynamic Algorithms |
120
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
127
click to vote
PODS
2005
ACM
16 years 3 months ago
2005
ACM
All known algorithms for evaluating advanced XPath queries (e.g., ones with predicates or with closure axes) on XML streams employ buffers to temporarily store fragments of the do...
130
Voted
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
127
click to vote
CCE
2006
15 years 3 months ago
2006
In this paper, we address the problem of optimal synthesis of an integrated water system, where water using processes and water treatment operations are combined into a single net...
156
Voted
TC
2002
15 years 3 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...