Sciweavers

1414 search results - page 117 / 283
» Randomness and Universal Machines
Sort
View
DAGSTUHL
2009
13 years 11 months ago
Statistical Mechanics of On-line Learning
We introduce and discuss the application of statistical physics concepts in the context of on-line machine learning processes. The consideration of typical properties of very large...
Michael Biehl, Nestor Caticha, Peter Riegler
ICML
1999
IEEE
14 years 10 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
ECTEL
2009
Springer
14 years 4 months ago
Assessing Collaboration Quality in Synchronous CSCL Problem-Solving Activities: Adaptation and Empirical Evaluation of a Rating
The work described is part of an ongoing interdisciplinary collaboration between two research teams of the University of Patras, Greece and the University of Freiburg, Germany, whi...
Georgios Kahrimanis, Anne Meier, Irene-Angelica Ch...
TIME
2006
IEEE
14 years 4 months ago
In time alone: on the computational power of querying the history
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
Alexei Lisitsa, Igor Potapov
ICALT
2005
IEEE
14 years 3 months ago
Building Repositories of Learning Objects in Specialized Domains: The Chasqui Approach
In this paper we describe the Chasqui approach to the construction of repositories of learning objects (LO) in specific knowledge areas. This approach is the result of our experie...
José Luis Sierra, Alfredo Fernández-...