12257 search results - page 2265 / 2452 » Analysis of Algorithms |
150
Voted
STOC
2007
ACM
16 years 3 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...
139
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
In this paper we consider bounded real-valued functions over the discrete cube, f : {-1, 1}n [-1, 1]. Such functions arise naturally in theoretical computer science, combinatorics...
144
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
144
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
222
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...