1139 search results - page 86 / 228 » Bounded Ideation Theory |
133
click to vote
JMLR
2002
15 years 3 months ago
2002
A fundamental open problem in computational learning theory is whether there is an attribute efficient learning algorithm for the concept class of decision lists (Rivest, 1987; Bl...
137
click to vote
ML
2002
ACM
15 years 3 months ago
2002
ACM
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
128
click to vote
TIT
2011
14 years 11 months ago
2011
For integer r satisfying 0 ≤ r ≤ p − 2, a sequence family Ωr of polyphase sequences of prime period p, size (p − 2)pr , and maximum correlation at most 2 + (r + 1) √ p...
148
click to vote
ACIIDS
2009
IEEE
15 years 2 months ago
2009
IEEE
In this study, we strive to combine the advantages of fuzzy theory, genetic algorithms (GA), H tracking control schemes, smooth control and adaptive laws to design an adaptive fuzz...
221
click to vote
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...