429 search results - page 49 / 86 » Noisy Turing Machines |
103
click to vote
IANDC
2007
14 years 9 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
104
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
: The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generato...
PRICAI
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. This paper reports our comparative evaluation of three machine learning methods on Chinese text categorization. Whereas a wide range of methods have been applied to Engli...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Most current multi-task learning frameworks ignore the robustness issue, which means that the presence of "outlier" tasks may greatly reduce overall system performance. ...
ICML
2009
IEEE
15 years 4 months ago
2009
IEEE
We describe a probabilistic approach for supervised learning when we have multiple experts/annotators providing (possibly noisy) labels but no absolute gold standard. The proposed...