Sciweavers

CORR
2012
Springer
210views Education» more  CORR 2012»
12 years 1 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»
12 years 1 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»
12 years 1 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»
12 years 1 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
CORR
2012
Springer
176views Education» more  CORR 2012»
12 years 1 days ago
Capturing Topology in Graph Pattern Matching
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...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
CORR
2012
Springer
198views Education» more  CORR 2012»
12 years 1 days ago
Lipschitz Parametrization of Probabilistic Graphical Models
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 ...
Jean Honorio
CORR
2012
Springer
229views Education» more  CORR 2012»
12 years 1 days ago
Resource Allocation with Subcarrier Pairing in OFDMA Two-Way Relay Networks
Abstract—This study considers an orthogonal frequencydivision multiple-access (OFDMA)-based multi-user two-way relay network where multiple mobile stations (MSs) communicate with...
Hao Zhang, Yuan Liu, Meixia Tao
CORR
2012
Springer
194views Education» more  CORR 2012»
12 years 1 days ago
A Graph Theoretical Approach to Network Encoding Complexity
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
Li Xu, Weiping Shang, Guangyue Han
CORR
2012
Springer
197views Education» more  CORR 2012»
12 years 1 days ago
Crowdsourcing with Endogenous Entry
Arpita Ghosh, R. Preston McAfee
CORR
2012
Springer
188views Education» more  CORR 2012»
12 years 1 days ago
A Logical Characterization of Constraint-Based Causal Discovery
We present a novel approach to constraintbased causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about ca...
Tom Claassen, Tom Heskes