Sciweavers

1080 search results - page 99 / 216
» Problem dependent optimization (PDO)
Sort
View
165
Voted
ICPR
2006
IEEE
16 years 5 months ago
Fast Support Vector Machine Classification using linear SVMs
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...
Karina Zapien Arreola, Janis Fehr, Hans Burkhardt
FLAIRS
2008
15 years 6 months ago
Evolutionary Learning of Dynamic Naive Bayesian Classifiers
Naive Bayesian classifiers work well in data sets with independent attributes. However, they perform poorly when the attributes are dependent or when there are one or more irrelev...
Miguel A. Palacios-Alonso, Carlos A. Brizuela, Lui...
COR
2010
119views more  COR 2010»
15 years 4 months ago
Algorithms for a realistic variant of flowshop scheduling
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...
B. Naderi, Rubén Ruiz, M. Zandieh
146
Voted
CVPR
2005
IEEE
16 years 6 months ago
WaldBoost - Learning for Time Constrained Sequential Detection
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
Jan Sochman, Jiri Matas
TSP
2010
14 years 11 months ago
Distributed learning in multi-armed bandit with multiple players
We formulate and study a decentralized multi-armed bandit (MAB) problem. There are distributed players competing for independent arms. Each arm, when played, offers i.i.d. reward a...
Keqin Liu, Qing Zhao