1778 search results - page 161 / 356 » On the Power of the Randomized Iterate |
148
click to vote
CEC
2003
IEEE
15 years 11 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
125
click to vote
MSS
2000
IEEE
15 years 11 months ago
2000
IEEE
— We examine the primary challenges for building a practical and competitive holographic random access memory (HRAM) system, specifically size, speed, and cost. We show that a fa...
170
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
219
click to vote
DAMON
2008
Springer
15 years 8 months ago
2008
Springer
As access times to main memory and disks continue to diverge, faster non-volatile storage technologies become more attractive for speeding up data analysis applications. NAND flas...
158
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...