Sciweavers

3875 search results - page 668 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
PADS
1999
ACM
14 years 1 months ago
Exploiting Temporal Uncertainty in Parallel and Distributed Simulations
Most work to date in parallel and distributed discrete event simulation is based on assigning precise time stamps to events, and time stamp order event processing. An alternative ...
Richard Fujimoto
CISS
2011
IEEE
13 years 18 days ago
Sparsity penalties in dynamical system estimation
—In this work we address the problem of state estimation in dynamical systems using recent developments in compressive sensing and sparse approximation. We formulate the traditio...
Adam Charles, Muhammad Salman Asif, Justin K. Romb...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 9 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
ICIP
2007
IEEE
14 years 10 months ago
Compressed Sensing Image Reconstruction Via Recursive Spatially Adaptive Filtering
We introduce a new approach to image reconstruction from highly incomplete data. The available data are assumed to be a small collection of spectral coef?cients of an arbitrary li...
Karen O. Egiazarian, Alessandro Foi, Vladimir Katk...
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...