792 search results - page 81 / 159 » Reading What Machines |
STACS
1999
Springer
14 years 1 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
SIGMOD
2010
ACM
14 years 1 months ago
2010
ACM
To take full advantage of the parallelism offered by a multicore machine, one must write parallel code. Writing parallel code is difficult. Even when one writes correct code, the...
AGENTS
1999
Springer
14 years 1 months ago
1999
Springer
Most work on intelligent information agents has thus far focused on systems that are accessible through the World Wide Web. As demanding schedules prohibit people from continuous ...
CHI
2004
ACM
14 years 9 months ago
2004
ACM
Editing speech data is currently time-consuming and errorprone. Speech editors rely on acoustic waveform representations, which force users to repeatedly sample the underlying spe...
CHI
2002
ACM
14 years 9 months ago
2002
ACM
Increasing amounts of public, corporate, and private speech data are now available on-line. These are limited in their usefulness, however, by the lack of tools to permit their br...