2098 search results - page 114 / 420 » The Persistent Abstract Machine |
114
Voted
MFCS
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
140
click to vote
IMCSIT
2010
15 years 2 months ago
2010
Abstract--We present a method for improving existing statistical machine translation methods using an knowledge-base compiled from a bilingual corpus as well as sequence alignment ...
107
click to vote
ICANN
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Capturing regularities in high-dimensional data is an important problem in machine learning and signal processing. Here we present a statistical model that learns a nonli...
152
click to vote
EAMT
1993
15 years 9 months ago
1993
Daelemans W. Abstraction Considered Harmful: Lazy Learning of Language Processing. Proceedings of the 6th 5th Belgian-Dutch Conference on Machine Learning 1996; 3-12.
124
click to vote
ICML
2002
IEEE
16 years 5 months ago
2002
IEEE
An open problem in reinforcement learning is discovering hierarchical structure. HEXQ, an algorithm which automatically attempts to decompose and solve a model-free factored MDP h...