806 search results - page 28 / 162 » Lower Bounds on Correction Networks |
160
click to vote
AHSWN
2010
15 years 6 months ago
2010
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...
178
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
138
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
136
click to vote
DAM
2008
15 years 6 months ago
2008
In this paper we give a construction of T-shift synchronization codes, i.e. block codes capable of correcting synchronization shifts of length at most T in either direction (left ...
152
click to vote
DATE
2003
IEEE
15 years 11 months ago
2003
IEEE
The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing anal...