2069 search results - page 116 / 414 » Linear time algorithms for Clobber |
127
click to vote
COLT
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We develop three new techniques to build on the recent advances in online learning with kernels. First, we show that an exponential speed-up in prediction time per trial ...
150
click to vote
ECCC
2010
15 years 2 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
153
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
121
click to vote
DM
2006
15 years 4 months ago
2006
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
127
click to vote
CVPR
2009
IEEE
15 years 8 months ago
2009
IEEE
Visual tracking is a key component in many computer vision applications. Linear subspace techniques (e.g. eigentracking) are one of the most popular approaches to align templates ...