Sciweavers

20 search results - page 3 / 4
» BoltzRank: learning to maximize expected ranking gain
Sort
View
CVPR
2007
IEEE
14 years 7 months ago
Element Rearrangement for Tensor-Based Subspace Learning
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
Shuicheng Yan, Dong Xu, Stephen Lin, Thomas S. Hua...
IOR
2010
99views more  IOR 2010»
13 years 3 months ago
Dynamic Pricing with a Prior on Market Response
We study a problem of dynamic pricing faced by a vendor with limited inventory, uncertain about demand, aiming to maximize expected discounted revenue over an infinite time horiz...
Vivek F. Farias, Benjamin Van Roy
SIGIR
2005
ACM
13 years 11 months ago
Question answering passage retrieval using dependency relations
State-of-the-art question answering (QA) systems employ termdensity ranking to retrieve answer passages. Such methods often retrieve incorrect passages as relationships among ques...
Hang Cui, Renxu Sun, Keya Li, Min-Yen Kan, Tat-Sen...
CVPR
2009
IEEE
15 years 14 days ago
What's It Going to Cost You?: Predicting Effort vs. Informativeness for Multi-Label Image Annotations
Active learning strategies can be useful when manual labeling effort is scarce, as they select the most informative examples to be annotated first. However, for visual category ...
Sudheendra Vijayanarasimhan (University of Texas a...
KDD
2010
ACM
289views Data Mining» more  KDD 2010»
13 years 3 months ago
Exploitation and exploration in a performance based contextual advertising system
The dynamic marketplace in online advertising calls for ranking systems that are optimized to consistently promote and capitalize better performing ads. The streaming nature of on...
Wei Li 0010, Xuerui Wang, Ruofei Zhang, Ying Cui, ...