203 search results - page 20 / 41 » Exponentiable morphisms of domains |
IJCAI
1989
13 years 8 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
We propose a novel algorithm for sparse system identification in the frequency domain. Key to our result is the observation that the Fourier transform of the sparse impulse respo...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Gaussian mixture models (GMMs) are a convenient and essential tool for the estimation of probability density functions. Although GMMs are used in many research domains from image ...
AUTOMATICA
2008
13 years 7 months ago
2008
We consider the problem of stabilization of a one-dimensional wave equation that contains instability at its free end and control on the opposite end. In contrast to classical col...