1382 search results - page 112 / 277 » Formal Analysis of Online Algorithms |
212
Voted
EMNLP
2010
15 years 4 months ago
2010
In this paper, we develop multilingual supervised latent Dirichlet allocation (MLSLDA), a probabilistic generative model that allows insights gleaned from one language's data...
200
Voted
ICS
2005
Tsinghua U.
15 years 11 months ago
2005
Tsinghua U.
Learning useful and predictable features from past workloads and exploiting them well is a major source of improvement in many operating system problems. We review known parallel ...
203
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We present a new online learning algorithm in the selective sampling framework, where labels must be actively queried before they are revealed. We prove bounds on the regret of ou...
149
Voted
CLA
2004
15 years 7 months ago
2004
An important problem in applications of formal concept analysis is a possibly large number of clusters extracted from data. Factorization is one of the methods being used to cope w...
136
click to vote
ESA
2009
Springer
16 years 21 days ago
2009
Springer
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...