Sciweavers

Share
CORR
2011
Springer
214views Education» more  CORR 2011»
8 years 3 months ago
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
Piotr Indyk, Eric Price
TIT
2010
104views Education» more  TIT 2010»
8 years 6 months ago
Nonparametric statistical inference for ergodic processes
In this work a method for statistical analysis of time series is proposed, which is used to obtain solutions to some classical problems of mathematical statistics under the only as...
Daniil Ryabko, Boris Ryabko
TEC
2010
120views more  TEC 2010»
8 years 6 months ago
Benefits of a Population: Five Mechanisms That Advantage Population-Based Algorithms
This paper identifies five distinct mechanisms by which a population-based algorithm might have an advantage over a solo-search algorithm in classical optimization. These mechanism...
Adam Prügel-Bennett
SOCO
2010
Springer
8 years 6 months ago
Using evolution strategies to solve DEC-POMDP problems
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...
Baris Eker, H. Levent Akin
JSYML
2010
95views more  JSYML 2010»
8 years 6 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
JAR
2011
112views more  JAR 2011»
8 years 6 months ago
A Framework for Certified Boolean Branch-and-Bound Optimization
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...
SIAMIS
2011
8 years 6 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...
CORR
2011
Springer
202views Education» more  CORR 2011»
8 years 6 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...
CORR
2011
Springer
167views Education» more  CORR 2011»
8 years 6 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
8 years 6 months ago
The decentralized implementability problem
Abstract-- This paper deals with the problems of decentralized implementability and decentralized regular implementability in the context of finite-dimensional linear differential ...
Shaik Fiaz, Harry L. Trentelman
books