569 search results - page 94 / 114 » Online Bounds for Bayesian Algorithms |
KDD
2007
ACM
15 years 10 months ago
2007
ACM
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
106
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Blind source separation (BSS) is a process to reconstruct source signals from the mixed signals. The standard BSS methods assume a fixed set of stationary source signals with the ...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
ICTCS
2005
Springer
15 years 3 months ago
2005
Springer
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...