Sciweavers

CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 6 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
CORR
2011
Springer
146views Education» more  CORR 2011»
13 years 6 months ago
Refined bounds on the number of connected components of sign conditions on a variety
Let R be a real closed field, P, Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk b...
Sal Barone, Saugata Basu
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 6 months ago
Nonuniform Coverage Control on the Line
Abstract— This paper investigates control laws allowing mobile, autonomous agents to optimally position themselves on the line for distributed sensing in a nonuniform field. We ...
Naomi Ehrich Leonard, Alexander Olshevsky
CORR
2011
Springer
136views Education» more  CORR 2011»
13 years 6 months ago
Degree Fluctuations and the Convergence Time of Consensus Algorithms
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
Alexander Olshevsky, John N. Tsitsiklis
CORR
2011
Springer
282views Education» more  CORR 2011»
13 years 6 months ago
Fast Linearized Bregman Iteration for Compressive Sensing and Sparse Denoising
We propose and analyze an extremely fast, efficient and simple method for solving the problem: min{ u 1 :Au=f,u∈Rn }. This method was first described in [1], with more details i...
Stanley Osher, Yu Mao, Bin Dong, Wotao Yin
CORR
2011
Springer
205views Education» more  CORR 2011»
13 years 6 months ago
On the algebraic numbers computable by some generalized Ehrenfest urns
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
Marie Albenque, Lucas Gerin
CORR
2011
Springer
183views Education» more  CORR 2011»
13 years 6 months ago
Mean-Variance Optimization in Markov Decision Processes
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
Shie Mannor, John N. Tsitsiklis
CORR
2011
Springer
150views Education» more  CORR 2011»
13 years 6 months ago
Optimal coding for the deletion channel with small deletion probability
The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Input bits are deleted independently with probability d, and when th...
Yashodhan Kanoria, Andrea Montanari
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 6 months ago
Maximum Metric Spanning Tree made Byzantine Tolerant
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...