Sciweavers

CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 10 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 10 months ago
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
D. Leventhal, A. S. Lewis
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 10 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 10 months ago
Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents
In this paper, we are interested in the combinatorial analysis of the whole genome duplication - random loss model of genome rearrangement initiated in [8] and [7]. In this model,...
Mathilde Bouvel, Elisa Pergola
CORR
2008
Springer
61views Education» more  CORR 2008»
13 years 10 months ago
GRID-Launcher v.1.0
N. Deniskina, Massimo Brescia, Stefano Cavuoti, Gi...
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 10 months ago
Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices
We study the information-theoretic limits of exactly recovering the support set of a sparse signal, using noisy projections defined by various classes of measurement matrices. Our ...
Wei Wang, Martin J. Wainwright, Kannan Ramchandran
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 10 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 10 months ago
Game Refinement Relations and Metrics
Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, ...
CORR
2008
Springer
100views Education» more  CORR 2008»
13 years 10 months ago
Myopic Coding in Multiterminal Networks
Lawrence Ong, Mehul Motani
CORR
2008
Springer
66views Education» more  CORR 2008»
13 years 10 months ago
On stars and Steiner stars. II
A Steiner star for a set P of n points in Rd connects an arbitrary center point to all points of P, while a star connects a point p P to the remaining n-1 points of P. All connec...
Adrian Dumitrescu, Csaba D. Tóth, Guangwu X...