2512 search results - page 74 / 503 » Learning from Highly Structured Data by Decomposition |
108
click to vote
STACS
2010
Springer
15 years 4 months ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
ML
2002
ACM
14 years 9 months ago
2002
ACM
Solving in an efficient manner many different optimal control tasks within the same underlying environment requires decomposing the environment into its computationally elemental ...
104
click to vote
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern min...
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper, we compare both discriminative and generative parameter learning on both discriminatively and generatively structured Bayesian network classifiers. We use either ma...