2566 search results - page 97 / 514 » The Online Median Problem |
137
click to vote
ICIP
2007
IEEE
16 years 3 days 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...
152
click to vote
WAOA
2004
Springer
15 years 11 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...
155
click to vote
NIPS
2004
15 years 7 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...
162
click to vote
AOR
2006
15 years 5 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...
165
click to vote
PRL
2008
15 years 5 months ago
2008
This paper proposes a new approach for classifying multivariate time-series with applications to the problem of writer independent online handwritten character recognition. Each t...