15033 search results - page 231 / 3007 » Complexity Theory and Algorithms |
124
click to vote
NECO
2010
15 years 3 months ago
2010
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
115
click to vote
TIP
2011
14 years 11 months ago
2011
This paper explores the mathematical and algorithmic properties of two sample-based microtexture models: random phase noise (RPN ) and asymptotic discrete spot noise (ADSN ). Thes...
201
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
156
click to vote
ACRI
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper reviews the history of embedded, evolvable selfreplicating structures implemented as cellular automata systems. We relate recent advances in this field to the...
145
click to vote
ILP
2004
Springer
15 years 10 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...