2095 search results - page 129 / 419 » Improved pebbling bounds |
187
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
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...
199
click to vote
GECCO
2011
Springer
14 years 10 months ago
2011
Springer
This paper introduces mirrored sampling into evolution strategies (ESs) with weighted multi-recombination. Two further heuristics are introduced: pairwise selection selects at mos...
159
click to vote
TCC
2012
Springer
14 years 2 months ago
2012
Springer
We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the numb...
182
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
221
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
We propose a framework that performs action recognition and identity maintenance of multiple targets simultaneously. Instead of first establishing tracks using an appearance mode...