1414 search results - page 160 / 283 » Randomness and Universal Machines |
116
click to vote
COLING
2010
14 years 10 months ago
2010
We use robust and fast Finite-State Machines (FSMs) to solve scriptural translation problems. We describe a phonetico-morphotactic pivot UIT (universal intermediate transcription)...
118
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
Information theoretic based measures form a fundamental class of similarity measures for comparing clusterings, beside the class of pair-counting based and set-matching based meas...
134
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...
116
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
In this paper we introduce the first algorithms for efficiently learning a simulation policy for Monte-Carlo search. Our main idea is to optimise the balance of a simulation polic...
127
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
A plausible representation of relational information among entities in dynamic systems such as a living cell or a social community is a stochastic network which is topologically r...