Sciweavers

2477 search results - page 49 / 496
» Approximate extended formulations
Sort
View
ICIP
2008
IEEE
14 years 4 months ago
Total variation super resolution using a variational approach
In this paper we propose a novel algorithm for super resolution based on total variation prior and variational distribution approximations. We formulate the problem using a hierar...
S. Derin Babacan, Rafael Molina, Aggelos K. Katsag...
SODA
2012
ACM
185views Algorithms» more  SODA 2012»
12 years 2 days ago
On a linear program for minimum-weight triangulation
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
Arman Yousefi, Neal E. Young
ATAL
2007
Springer
14 years 3 months ago
Constraint satisfaction algorithms for graphical games
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
Vishal Soni, Satinder P. Singh, Michael P. Wellman
AAAI
2006
13 years 11 months ago
Learning Basis Functions in Hybrid Domains
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht
AMC
2004
105views more  AMC 2004»
13 years 9 months ago
Block matrix Sinc-Galerkin solution of the wind-driven current problem
A block matrix formulation is presented for the Sinc-Galerkin technique applied to the wind-driven current problem from oceanography. The block matrix form is used to determine an...
Sanoe Koonprasert, Kenneth L. Bowers