2372 search results - page 53 / 475 » is 2012 |
167
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
204
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
We develop a new method for proving explicit approximation lower bounds for TSP problems with bounded metrics improving on the best up to now known bounds. They almost match the b...
174
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
This paper examines the problem of learning with a finite and possibly large set of p base kernels. It presents a theoretical and empirical analysis of an approach addressing thi...
173
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
We address the online linear optimization problem with bandit feedback. Our contribution is twofold. First, we provide an algorithm (based on exponential weights) with a regret of...
153
click to vote
ESOP
2012
Springer
14 years 1 months ago
2012
Springer
A lock placement describes, for each heap location, which lock guards the location, and under what circumstances. We formalize methods for reasoning about lock placements, making p...