3016 search results - page 295 / 604 » The Online Transportation Problem |
142
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally ...
143
click to vote
AAAI
2008
15 years 8 months ago
2008
We consider the problems of sequential prediction and change detection that arise often in interactive applications: A semi-automatic predictor is applied to a time-series and is ...
172
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We study metric learning as a problem of information retrieval. We present a general metric learning algorithm, based on the structural SVM framework, to learn a metric such that ...
222
click to vote
Publication
We present a class of models that, via a simple construction,
enables exact, incremental, non-parametric, polynomial-time,
Bayesian inference of conditional measures. The approac...
164
Voted
INFOCOM
2006
IEEE
16 years 5 days ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...