106 search results - page 19 / 22 » Proving Lower Bounds Via Pseudo-random Generators |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
DATE
2008
IEEE
14 years 1 months ago
2008
IEEE
The importance of testing approaches that exploit error tolerance to improve yield has previously been established. Error rate, defined as the percentage of vectors for which the...
ISAAC
2005
Springer
14 years 29 days ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
SRDS
1999
IEEE
13 years 11 months ago
1999
IEEE
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...
AAIM
2009
Springer
13 years 5 months ago
2009
Springer
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...