806 search results - page 29 / 162 » Lower Bounds on Correction Networks |
109
Voted
CRYPTO
2003
Springer
15 years 2 months ago
2003
Springer
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
COLT
2008
Springer
14 years 11 months ago
2008
Springer
A kernel over the Boolean domain is said to be reflection-invariant, if its value does not change when we flip the same bit in both arguments. (Many popular kernels have this prop...
JACM
2002
14 years 9 months ago
2002
Abstract. Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication obj...
83
Voted
TSP
2010
14 years 4 months ago
2010
Abstract-- Information theory provides a novel perspective on passive sonar performance analysis. This approach begins by partitioning the search space and then considers the probl...
93
Voted
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...