5214 search results - page 125 / 1043 » The Online Specialization Problem |
ICTIR
2009
Springer
14 years 4 months ago
2009
Springer
We address the problem of online term recurrence prediction: for a stream of terms, at each time point predict what term is going to recur next in the stream given the term occurre...
ICIP
2007
IEEE
14 years 4 months ago
2007
IEEE
Online target tracking requires to solve two problems: data association and online dynamic estimation. Usually, association effectiveness is based on prior information and observa...
WAOA
2004
Springer
14 years 3 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
NIPS
2004
13 years 11 months ago
2004
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make valu...
AOR
2006
13 years 10 months ago
2006
The problem of on-line bin packing restricted to instances with only two item sizes (known in advance) has a well-known lower bound of 4/3 for its asymptotic competitive ratio. We...