267 search results - page 15 / 54 » Online Auctions: There Can Be Only One |
IPL
2008
14 years 11 months ago
2008
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...
PERCOM
2006
ACM
15 years 11 months ago
2006
ACM
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of ...
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
It has recently been shown that only a small number of samples from a low-rank matrix are necessary to reconstruct the entire matrix. We bring this to bear on computer vision prob...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Discriminative tracking has become popular tracking methods due to their descriptive power for foreground/background separation. Among these methods, online random forest is recen...
WEBI
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, we propose a methodology to predict the popularity of online contents. More precisely, rather than trying to infer the popularity of a content itself, we infer the l...