2168 search results - page 281 / 434 » Randomized Algorithms and Complexity Theory |
127
click to vote
ECCC
2010
15 years 26 days ago
2010
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
119
Voted
COLT
1999
Springer
15 years 7 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
124
Voted
KDD
1998
ACM
15 years 7 months ago
1998
ACM
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
126
click to vote
AAAI
2007
15 years 5 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
130
click to vote
CHES
2010
Springer
15 years 4 months ago
2010
Springer
Implementations of cryptographic algorithms are vulnerable to Side Channel Analysis (SCA). To counteract it, masking schemes are usually involved which randomize key-dependent data...