530 search results - page 36 / 106 » Universal randomized switching |
120
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
145
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
123
click to vote
ECCC
2010
15 years 3 months ago
2010
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
99
Voted
IJON
2008
15 years 3 months ago
2008
Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden nodes, IEEE Trans. Neural Networks 17(4) (2006) 879
149
click to vote
PKDD
2005
Springer
15 years 9 months ago
2005
Springer
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...