Sciweavers

267 search results - page 12 / 54
» Online Auctions: There Can Be Only One
Sort
View
WWW
2008
ACM
16 years 13 days ago
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
Yunhong Zhou, Victor Naroditskiy
ATAL
2003
Springer
15 years 5 months ago
Recommender systems: a market-based design
Recommender systems have been widely advocated as a way of coping with the problem of information overload for knowledge workers. Given this, multiple recommendation methods have ...
Yan Zheng Wei, Luc Moreau, Nicholas R. Jennings
ECCV
2008
Springer
16 years 1 months ago
Semi-supervised On-Line Boosting for Robust Tracking
Abstract. Recently, on-line adaptation of binary classifiers for tracking have been investigated. On-line learning allows for simple classifiers since only the current view of the ...
Helmut Grabner, Christian Leistner, Horst Bischof
MONET
2006
139views more  MONET 2006»
14 years 11 months ago
Market Driven Dynamic Spectrum Allocation over Space and Time among Radio-Access Networks: DVB-T and B3G CDMA with Heterogeneous
The radio frequency spectrum is a naturally limited resource of extraordinary value, as the key to the provision of important communication and information services. Traditionally,...
Virgilio Rodriguez, Klaus Moessner, Rahim Tafazoll...
TNN
2008
105views more  TNN 2008»
14 years 11 months ago
Incremental Learning of Chunk Data for Online Pattern Classification Systems
This paper presents a pattern classification system in which feature extraction and classifier learning are simultaneously carried out not only online but also in one pass where tr...
Seiichi Ozawa, Shaoning Pang, Nikola K. Kasabov