Sciweavers

137 search results - page 14 / 28
» Applying Decomposition Methods to Crossword Puzzle Problems
Sort
View
CSDA
2007
169views more  CSDA 2007»
13 years 8 months ago
A null space method for over-complete blind source separation
In blind source separation, there are M sources that produce sounds independently and continuously over time. These sounds are then recorded by m receivers. The sound recorded by ...
Ray-Bing Chen, Ying Nian Wu
SIAMJO
2010
127views more  SIAMJO 2010»
13 years 3 months ago
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
We consider a recently proposed optimization formulation of multi-task learning based on trace norm regularized least squares. While this problem may be formulated as a semidefini...
Ting Kei Pong, Paul Tseng, Shuiwang Ji, Jieping Ye
COMPUTING
2007
122views more  COMPUTING 2007»
13 years 8 months ago
Error estimation for Bregman iterations and inverse scale space methods in image restoration
In this paper we consider error estimation for image restoration problems based on generalized Bregman distances. This error estimation technique has been used to derive convergen...
Martin Burger, E. Resmerita, Lin He
AI
2003
Springer
14 years 1 months ago
A Graph Based Backtracking Algorithm for Solving General CSPs
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
Wanlin Pang, Scott D. Goodwin
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 8 months ago
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...
Sou-Cheng T. Choi, Christopher C. Paige, Michael A...