Sciweavers

2588 search results - page 8 / 518
» Applications of Kolmogorov complexity to computable model th...
Sort
View
FROCOS
2007
Springer
14 years 3 months ago
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
Viorica Sofronie-Stokkermans
TKDE
2010
151views more  TKDE 2010»
13 years 8 months ago
Dictionary-Based Compression for Long Time-Series Similarity
—Long time-series datasets are common in many domains, especially scientific domains. Applications in these fields often require comparing trajectories using similarity measure...
Willis Lang, Michael D. Morse, Jignesh M. Patel
ICCV
2003
IEEE
14 years 11 months ago
Controlling Model Complexity in Flow Estimation
This paper describes a novel application of Statistical Learning Theory (SLT) to control model complexity in flow estimation. SLT provides analytical generalization bounds suitabl...
Zoran Duric, Fayin Li, Harry Wechsler, Vladimir Ch...
ESANN
2007
13 years 11 months ago
An overview of reservoir computing: theory, applications and implementations
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
Benjamin Schrauwen, David Verstraeten, Jan M. Van ...
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 9 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson