Sciweavers

63 search results - page 3 / 13
» Entropy Regularized LPBoost
Sort
View
ARCS
2008
Springer
13 years 7 months ago
Potentials of Branch Predictors: From Entropy Viewpoints
Predictors essentially predicts the most recent events based on the record of past events, history. It is obvious that prediction performance largely relies on regularity
Takashi Yokota, Kanemitsu Ootsu, Takanobu Baba
COLT
2006
Springer
13 years 7 months ago
Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
Manfred K. Warmuth
ICPR
2008
IEEE
13 years 11 months ago
Directional entropy feature for human detection
In this paper we propose a novel feature, called directional entropy feature (DEF), to improve the performance of human detection under complicated background in images. DEF descr...
Long Meng, Liang Li, Shuqi Mei, Weiguo Wu
EXPCS
2007
13 years 9 months ago
Introducing entropies for representing program behavior and branch predictor performance
Predictors are inherent components of state-of-the-art microprocessors. Branch predictors are discussed actively from diverse perspectives. Performance of a branch predictor large...
Takashi Yokota, Kanemitsu Ootsu, Takanobu Baba
ICML
2006
IEEE
14 years 6 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth