Sciweavers

836 search results - page 110 / 168
» Online EM Algorithm for Latent Data Models
Sort
View
113
Voted
WWW
2008
ACM
16 years 1 months 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
86
Voted
IJON
2006
99views more  IJON 2006»
15 years 18 days ago
Learning vector quantization: The dynamics of winner-takes-all algorithms
Winner-Takes-All (WTA) prescriptions for Learning Vector Quantization (LVQ) are studied in the framework of a model situation: Two competing prototype vectors are updated accordin...
Michael Biehl, Anarta Ghosh, Barbara Hammer
111
Voted
COLING
2010
14 years 7 months ago
Contextual Recommendation based on Text Mining
The potential benefit of integrating contextual information for recommendation has received much research attention recently, especially with the ever-increasing interest in mobil...
Yize Li, Jiazhong Nie, Yi Zhang, Bingqing Wang, Ba...
ICPP
1998
IEEE
15 years 4 months ago
Improving Parallel-Disk Buffer Management using Randomized Writeback
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
Mahesh Kallahalla, Peter J. Varman
CVPR
2008
IEEE
16 years 2 months ago
Learning Bayesian Networks with qualitative constraints
Graphical models such as Bayesian Networks (BNs) are being increasingly applied to various computer vision problems. One bottleneck in using BN is that learning the BN model param...
Yan Tong, Qiang Ji