879 search results - page 66 / 176 » Kolmogorov Complexity and Model Selection |
159
click to vote
VLDB
1990
ACM
15 years 9 months ago
1990
ACM
Therequirementsfor amain memorydatastoragemodel are both compactnessand efficient processing for all database operations. The DBGraph storage model, proposed in this paper, achiev...
188
click to vote
ENTCS
2007
15 years 5 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
169
click to vote
AAAI
1990
15 years 7 months ago
1990
Although computers are widely used to simulate complex physical systems, crafting the underlying models that enable computer analysis remains difficult. When a model is created fo...
136
click to vote
ICML
2007
IEEE
16 years 6 months ago
2007
IEEE
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
163
click to vote
ICMLA
2008
15 years 7 months ago
2008
We revisit 26 meta-features typically used in the context of meta-learning for model selection. Using visual analysis and computational complexity considerations, we find 4 meta-f...