Sciweavers

137 search results - page 2 / 28
» Applying Decomposition Methods to Crossword Puzzle Problems
Sort
View
VECPAR
2004
Springer
13 years 10 months ago
Domain Decomposition Methods for PDE Constrained Optimization Problems
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
Ernesto E. Prudencio, Richard H. Byrd, Xiao-Chuan ...
ECCV
2010
Springer
13 years 10 months ago
Affine Puzzle: Realigning Deformed Object Fragments without Correspondences
This paper is addressing the problem of realigning broken objects without correspondences. We consider linear transformations between the object fragments and present the method ...
Csaba Domokos and Zoltan Kato
ICASSP
2011
IEEE
12 years 9 months ago
Non-stationary noise estimation method based on bias-residual component decomposition for robust speech recognition
This paper addresses a noise suppression problem, namely the estimation of non-stationary noise sequences. In this problem, we assume that non-stationary noise can be decomposed i...
Masakiyo Fujimoto, Shinji Watanabe, Tomohiro Nakat...
COR
2011
13 years 11 days ago
Time-constrained project scheduling with adjacent resources
We develop a decomposition method for the Time-Constrained Project Scheduling Problem (TCPSP) with Adjacent Resources. For adjacent resources the resource units are ordered and th...
Johann Hurink, A. L. Kok, Jacob Jan Paulus, J. M. ...
AUSAI
2008
Springer
13 years 7 months ago
Additive Regression Applied to a Large-Scale Collaborative Filtering Problem
Abstract. The much-publicized Netflix competition has put the spotlight on the application domain of collaborative filtering and has sparked interest in machine learning algorithms...
Eibe Frank, Mark Hall