Sciweavers

CORR
2012
Springer
174views Education» more  CORR 2012»
14 years 12 days ago
Partial Searchlight Scheduling is Strongly PSPACE-complete
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
Giovanni Viglietta
CORR
2012
Springer
179views Education» more  CORR 2012»
14 years 12 days ago
Distributional convergence for the number of symbol comparisons used by QuickSort
d Abstract) James Allen Fill1† 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Baltimore, MD 21218-2682 USA received 2...
James Allen Fill
CORR
2012
Springer
220views Education» more  CORR 2012»
14 years 12 days ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing
CORR
2012
Springer
189views Education» more  CORR 2012»
14 years 12 days ago
A temporally abstracted Viterbi algorithm
Shaunak Chatterjee, Stuart Russell
CORR
2012
Springer
163views Education» more  CORR 2012»
14 years 12 days ago
The Structure of Signals: Causal Interdependence Models for Games of Incomplete Information
Traditional economic models typically treat private information, or signals, as generated from some underlying state. Recent work has explicated alternative models, where signals ...
Michael P. Wellman, Lu Hong, Scott E. Page
CORR
2012
Springer
208views Education» more  CORR 2012»
14 years 12 days ago
Ensembles of Kernel Predictors
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...
Corinna Cortes, Mehryar Mohri, Afshin Rostamizadeh
CORR
2012
Springer
210views Education» more  CORR 2012»
14 years 12 days ago
Fast MCMC sampling for Markov jump processes and continuous time Bayesian networks
Markov jump processes and continuous time Bayesian networks are important classes of continuous time dynamical systems. In this paper, we tackle the problem of inferring unobserve...
Vinayak Rao, Yee Whye Teh
CORR
2012
Springer
179views Education» more  CORR 2012»
14 years 12 days ago
SybilControl: Practical Sybil Defense with Computational Puzzles
Frank Li, Prateek Mittal, Matthew Caesar, Nikita B...
CORR
2012
Springer
192views Education» more  CORR 2012»
14 years 12 days ago
The best of both worlds: stochastic and adversarial bandits
We present a bandit algorithm, SAO (Stochastic and Adversarial Optimal), whose regret is, essentially, optimal both for adversarial rewards and for stochastic rewards. Specifical...
Sébastien Bubeck, Aleksandrs Slivkins
CORR
2012
Springer
224views Education» more  CORR 2012»
14 years 12 days ago
On Approximation Lower Bounds for TSP with Bounded Metrics
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...
Marek Karpinski, Richard Schmied