174
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We present a bandit algorithm, SAO (Stochastic and Adversarial Optimal), whose regret is, essentially, optimal both for adversarial rewards and for stochastic rewards. Specifical...
227
click to vote
CORR
2012
Springer
14 years 2 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...
202
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
206
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the p-norm of the parameters. We discuss several implications ...
191
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Abstract—This study considers an orthogonal frequencydivision multiple-access (OFDMA)-based multi-user two-way relay network where multiple mobile stations (MSs) communicate with...