Sciweavers

2477 search results - page 67 / 496
» Approximate extended formulations
Sort
View
ECCC
2006
71views more  ECCC 2006»
15 years 3 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...
TIT
2011
116views more  TIT 2011»
14 years 10 months ago
Approximate Characterizations for the Gaussian Source Broadcast Distortion Region
We consider the joint source-channel coding problem of sending a Gaussian source over a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achieva...
Chao Tian, Suhas N. Diggavi, Shlomo Shamai
120
Voted
BIRTHDAY
2005
Springer
15 years 9 months ago
Reduction Strategies for Left-Linear Term Rewriting Systems
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
Yoshihito Toyama
118
Voted
CVPR
2010
IEEE
15 years 12 months ago
Fast Approximate Energy Minimization with Label Costs
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
Andrew Delong, Anton Osokin, Hossam Isack, Yuri Bo...
ICASSP
2008
IEEE
15 years 10 months ago
Stable sparse approximations via nonconvex optimization
We present theoretical results pertaining to the ability of ℓp minimization to recover sparse and compressible signals from incomplete and noisy measurements. In particular, we ...
Rayan Saab, Rick Chartrand, Özgür Yilmaz