4940 search results - page 145 / 988 » On the Complexity of Universal Programs |
127
Voted
COLT
2004
Springer
15 years 10 months ago
2004
Springer
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
165
Voted
ALT
1997
Springer
15 years 9 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
169
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
: We review the singular value decomposition (SVD) and discuss some lesser-known applications of it that we find particularly interesting. We also discuss generalizations of the S...
150
click to vote
TOG
2012
13 years 7 months ago
2012
Algebra I, II Complex Variables I, II Analysis I, II Awards, Scholarships, Fellowships Received • Back Cover Image, Proceedings of ACM SIGGRAPH, 2011 • New York University Henr...
177
Voted
PC
2002
15 years 4 months ago
2002
riented programming, design patterns, and frameworks are abstraction techniques that have been used to reduce the complexity of sequential programming. This paper describes our ap...