Sciweavers

1139 search results - page 86 / 228
» Bounded Ideation Theory
Sort
View
JMLR
2002
83views more  JMLR 2002»
13 years 8 months ago
On Online Learning of Decision Lists
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...
Ziv Nevo, Ran El-Yaniv
ML
2002
ACM
141views Machine Learning» more  ML 2002»
13 years 8 months ago
On the Existence of Linear Weak Learners and Applications to Boosting
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...
Shie Mannor, Ron Meir
TIT
2011
102views more  TIT 2011»
13 years 4 months ago
Sequence Families With Low Correlation Derived From Multiplicative and Additive Characters
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...
Kai-Uwe Schmidt
ACIIDS
2009
IEEE
159views Database» more  ACIIDS 2009»
13 years 7 months ago
Application to GA-Based Fuzzy Control for Nonlinear Systems with Uncertainty
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...
Po-Chen Chen, Ken Yeh, Cheng-Wu Chen, Chen-Yuan Ch...
ECCV
2010
Springer
13 years 6 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
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...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...