Sciweavers

5115 search results - page 943 / 1023
» On Randomized Lanczos Algorithms
Sort
View
134
Voted
RECOMB
2004
Springer
16 years 2 months ago
The evolutionary capacity of protein structures
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ro...
102
Voted
STOC
2007
ACM
105views Algorithms» more  STOC 2007»
16 years 2 months ago
Balanced allocations: the weighted case
We investigate balls-and-bins processes where m weighted balls are placed into n bins using the "power of two choices" paradigm, whereby a ball is inserted into the less...
Kunal Talwar, Udi Wieder
140
Voted
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
16 years 2 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
124
Voted
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 2 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
123
Voted
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
16 years 2 months ago
Covert two-party computation
We introduce the novel concept of covert two-party computation. Whereas ordinary secure two-party computation only guarantees that no more knowledge is leaked about the inputs of t...
Luis von Ahn, Nicholas J. Hopper, John Langford