5214 search results - page 253 / 1043 » The Online Specialization Problem |
134
Voted
DAM
2006
15 years 6 months ago
2006
: In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for m...
193
click to vote
COLT
2005
Springer
15 years 8 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
173
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- An online approach to parameter estimation problems based on binary observations is presented in this paper. This recursive identification method relies on a least-mean ...
179
click to vote
FUZZIEEE
2007
IEEE
16 years 1 months ago
2007
IEEE
—In this paper, we propose a new nonlinear classier based on a generalized Choquet integral with signed fuzzy measures to enhance the classification power by capturing all possib...
151
click to vote
BIRTHDAY
2005
Springer
16 years 6 days ago
2005
Springer
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...