20294 search results - page 98 / 4059 » Algorithmic Information Theory |
149
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
145
click to vote
SOFSEM
2010
Springer
16 years 1 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
RECOMB
2003
Springer
16 years 4 months ago
2003
Springer
142
click to vote
UAI
2001
15 years 5 months ago
2001
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
144
click to vote
PERCOM
2004
ACM
16 years 3 months ago
2004
ACM
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...