Sciweavers

4940 search results - page 184 / 988
» On the Complexity of Universal Programs
Sort
View
COLT
1994
Springer
15 years 10 months ago
Bayesian Inductive Logic Programming
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
Stephen Muggleton
KDD
1999
ACM
128views Data Mining» more  KDD 1999»
15 years 10 months ago
Towards Automated Synthesis of Data Mining Programs
Code synthesis is routinely used in industry to generate GUIs, form lling applications, and database support code and is even used with COBOL. In this paper we consider the questi...
Wray L. Buntine, Bernd Fischer 0002, Thomas Pressb...
IPCC
1998
92views more  IPCC 1998»
15 years 7 months ago
Evaluating Distance Learning in Graduate Programs: Ensuring Rigorous, Rewarding Professional Education
: Internet-based distance learning programs make it possible for technical communicators located anywhere in the world to participate in graduate courses in their field. But are th...
George F. Hayhoe
CORR
2008
Springer
137views Education» more  CORR 2008»
15 years 7 months ago
Communications in cellular automata
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic p...
Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapap...
TIT
1998
123views more  TIT 1998»
15 years 5 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu