69 search results - page 5 / 14 » Maximal Intersection Queries in Randomized Input Models |
118
click to vote
VTS
2002
IEEE
15 years 5 months ago
2002
IEEE
We present a software-based weighted random pattern scheme for testing delay faults in IP cores of programmable SoCs. We describe a method for determining static and transition pr...
151
click to vote
STOC
2000
ACM
15 years 4 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
122
Voted
STOC
2007
ACM
16 years 20 days ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
87
Voted
ALGORITHMICA
2002
15 years 7 days ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
117
click to vote
JCSS
2008
15 years 10 days ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...