103 search results - page 4 / 21 » An Asymptotically Optimal Bandit Algorithm for Bounded Suppo... |
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
UAI
2003
13 years 6 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
ICCV
2011
IEEE
12 years 5 months ago
2011
IEEE
Fitting statistical 2D and 3D shape models to images is necessary for a variety of tasks, such as video editing and face recognition. Much progress has been made on local fitting...
COMPGEOM
2009
ACM
13 years 12 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...