Sciweavers

70 search results - page 3 / 14
» Approximation Reformulations
Sort
View
CDC
2009
IEEE
150views Control Systems» more  CDC 2009»
13 years 10 months ago
Cooperative adaptive sampling via approximate entropy maximization
— This work deals with a group of mobile sensors sampling a spatiotemporal random field whose mean is unknown and covariance is known up to a scaling parameter. The Bayesian pos...
Rishi Graham, Jorge Cortés
ICASSP
2011
IEEE
12 years 9 months ago
Compressive sensing meets game theory
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
Sina Jafarpour, Robert E. Schapire, Volkan Cevher
ICASSP
2011
IEEE
12 years 9 months ago
Robust binary least squares: Relaxations and algorithms
Finding the least squares (LS) solution s to a system of linear equations Hs = y where H, y are given and s is a vector of binary variables, is a well known NP-hard problem. In th...
Efthymios Tsakonas, Joakim Jalden, Björn E. O...
SIAMSC
2008
146views more  SIAMSC 2008»
13 years 5 months ago
Long Time Numerical Solution of the Navier--Stokes Equations Based on a Sequential Regularization Formulation
Abstract. The sequential regularization method is a reformulation of the unsteady Navier-Stokes equations from the view point of constrained dynamical systems or approximate Helmho...
Ping Lin, Jian-Guo Liu, Xiliang Lu
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
13 years 11 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein