Sciweavers

3114 search results - page 90 / 623
» Distributed Case-Based Learning
Sort
View
ICML
1999
IEEE
16 years 2 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
COLT
1995
Springer
15 years 5 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
SIGCSE
2010
ACM
186views Education» more  SIGCSE 2010»
15 years 8 months ago
Teaching operating systems using virtual appliances and distributed version control
Students learn more through hands-on project experience for computer science courses such as operating systems, but providing the infrastructure support for a large class to learn...
Oren Laadan, Jason Nieh, Nicolas Viennot
ICALT
2009
IEEE
15 years 8 months ago
Learning Activity Spaces: Towards Flexibility in Learning Design?
Designing a computer-supported learning scenario involving a constructivist approach of learning lays on a paradox. On the one hand, learning flows must be precisely described –...
Anne Lejeune, Muriel Ney, Armin Weinberger, Margus...
ICML
2006
IEEE
16 years 2 months ago
Estimating relatedness via data compression
We show that it is possible to use data compression on independently obtained hypotheses from various tasks to algorithmically provide guarantees that the tasks are sufficiently r...
Brendan Juba