1414 search results - page 43 / 283 » Randomness and Universal Machines |
CODES
1996
IEEE
14 years 25 days ago
1996
IEEE
The partitioning of image processing algorithms with a novel hardware/software co-designframework (CoDe-X) is presented in this paper, where a new Xputer-architecture (parallel Ma...
LREC
2010
13 years 10 months ago
2010
The goal of DARPA's Machine Reading (MR) program is nothing less than making the world's natural language corpora available for formal processing. Most text processing r...
FUIN
2007
13 years 8 months ago
2007
Abstract. We review the characterization of communicating finite-state machines whose behaviors have universally or existentially bounded channels. These results rely on the theor...
EUROCOLT
1999
Springer
14 years 28 days ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
ALT
2006
Springer
14 years 5 months ago
2006
Springer
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...