2095 search results - page 40 / 419 » Improved pebbling bounds |
COCO
2003
Springer
14 years 3 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
CONEXT
2005
ACM
13 years 12 months ago
2005
ACM
Wireless Mesh Networks (WMNs) are an emerging architecture based on multi-hop transmission. ISPs considers WMNs as a potential future technology to offer broadband Internet acces...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
DCG
2006
13 years 10 months ago
2006
We use circular sequences to give an improved lower bound on the minimum number of ( k)
CCR
2010
13 years 10 months ago
2010
We provide a detailed analysis of the Lossy Difference Aggregator, a recently developed data structure for measuring latency in a router environment where packet losses can occur....