Sciweavers

107 search results - page 8 / 22
» Random sampling and approximation of MAX-CSP problems
Sort
View
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
13 years 7 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
13 years 11 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
ICASSP
2011
IEEE
12 years 11 months ago
Causal signal recovery from U-invariant samples
Causal processing of a signal’s samples is crucial in on-line applications such as audio rate conversion, compression, tracking and more. This paper addresses the problem of cau...
Tomer Michaeli, Yonina C. Eldar, Volker Pohl
ANOR
2004
122views more  ANOR 2004»
13 years 7 months ago
Call Center Staffing with Simulation and Cutting Plane Methods
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...
Júlíus Atlason, Marina A. Epelman, S...
ICASSP
2009
IEEE
14 years 2 months ago
Compressive sampling of pulse trains: Spread the spectrum!
In this paper we consider the problem of sampling far below the Nyquist rate signals that are sparse linear superpositions of shifts of a known, potentially wide-band, pulse. This...
Farid M. Naini, Rémi Gribonval, Laurent Jac...