1511 search results - page 84 / 303 » Randomness, lowness and degrees |
146
click to vote
KDD
2000
ACM
15 years 9 months ago
2000
ACM
Existing data cleaning methods work on the basis of computing the degree of similarity between nearby records in a sorted database. High recall is achieved by accepting records wi...
145
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
In recent work, Kalai, Klivans, Mansour, and Servedio [KKMS05] studied a variant of the "Low-Degree (Fourier) Algorithm" for learning under the uniform probability distr...
151
click to vote
FOCS
2008
IEEE
16 years 19 days ago
2008
IEEE
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n1+o(1) log1+o(1) q bit operations; this had earlier been achiev...
159
click to vote
TGC
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. In this survey paper we consider the class of protocols for informationhiding which use randomization to obfuscate the link between the observables and the information to...
138
click to vote
AML
2006
15 years 6 months ago
2006
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...