Sciweavers

3495 search results - page 18 / 699
» On the random satisfiable process
Sort
View
ICIP
2005
IEEE
15 years 1 days ago
Segmenting non stationary images with triplet Markov fields
The hidden Markov field (HMF) model has been used in many model-based solutions to image analysis problems, including that of image segmentation, and generally gives satisfying re...
Dalila Benboudjema, Wojciech Pieczynski
ICASSP
2010
IEEE
13 years 10 months ago
Ergodic stochastic optimization algorithms for wireless communication and networking
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...
Alejandro Ribeiro
ICASSP
2011
IEEE
13 years 2 months ago
Deterministic compressed-sensing matrices: Where Toeplitz meets Golay
Recently, the statistical restricted isometry property (STRIP) has been formulated to analyze the performance of deterministic sampling matrices for compressed sensing. In this pa...
Kezhi Li, Cong Ling, Lu Gan
ICASSP
2011
IEEE
13 years 2 months ago
Short and smooth sampling trajectories for compressed sensing
This paper explores a novel setting for compressed sensing (CS) in which the sampling trajectory length is a critical bottleneck and must be minimized subject to constraints on th...
Rebecca M. Willett
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
14 years 2 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy