1525 search results - page 54 / 305 » Matching with Regular Constraints |
185
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
—In this paper we study the overparametrization scheme for Hammerstein systems [1] in the presence of regularization. The quality of the convex approximation is analysed, that is...
128
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
119
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Algorithms based on the minimization of the Total Variation are prevalent in computer vision. They are used in a variety of applications such as image denoising, compressive sensi...
100
Voted
JCO
2000
15 years 3 months ago
2000
We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0
282
click to vote
EMMCVPR
2011
Springer
14 years 3 months ago
2011
Springer
Length and area regularization are commonplace for inverse problems today. It has however turned out to be much more difficult to incorporate a curvature prior. In this paper we pr...