Sciweavers

1414 search results - page 203 / 283
» Randomness and Universal Machines
Sort
View
ICML
2003
IEEE
16 years 6 months ago
Text Bundling: Statistics Based Data-Reduction
As text corpora become larger, tradeoffs between speed and accuracy become critical: slow but accurate methods may not complete in a practical amount of time. In order to make the...
Lawrence Shih, Jason D. Rennie, Yu-Han Chang, Davi...
ICML
2001
IEEE
16 years 6 months ago
Direct Policy Search using Paired Statistical Tests
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
Malcolm J. A. Strens, Andrew W. Moore
ALT
2006
Springer
16 years 2 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
153
Voted
CEC
2009
IEEE
16 years 9 days ago
Evolving hypernetwork models of binary time series for forecasting price movements on stock markets
— The paper proposes a hypernetwork-based method for stock market prediction through a binary time series problem. Hypernetworks are a random hypergraph structure of higher-order...
Elena Bautu, Sun Kim, Andrei Bautu, Henri Luchian,...
FOCS
2009
IEEE
16 years 9 days ago
Regularity Lemmas and Combinatorial Algorithms
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
Nikhil Bansal, Ryan Williams