5153 search results - page 444 / 1031 » Introduction to Randomized Algorithms |
144
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
159
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
194
Voted
ICVGIP
2008
15 years 7 months ago
2008
As vision algorithms mature with increasing inspiration from the learning community, statistically independent pseudo random number generation (PRNG) becomes increasingly importan...
166
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
161
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...