Sciweavers

368 search results - page 36 / 74
» Some new iterative methods with three-order convergence
Sort
View
SADM
2008
178views more  SADM 2008»
13 years 7 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
ICCV
2003
IEEE
14 years 9 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi
ICIP
2005
IEEE
14 years 1 months ago
Automatic registration of 3D datasets using Gaussian fields
—In this paper we introduce a new 3D automatic registration method based on Gaussian fields and energy minimization. The method defines a simple ∞ C energy function, which is c...
Faysal Boughorbel, Andreas Koschan, Mongi A. Abidi
CEC
2007
IEEE
14 years 1 months ago
How well do multi-objective evolutionary algorithms scale to large problems
Abstract— In spite of large amount of research work in multiobjective evolutionary algorithms, most have evaluated their algorithms on problems with only two to four objectives. ...
Kata Praditwong, Xin Yao
CPAIOR
2011
Springer
12 years 11 months ago
Almost Square Packing
Abstract. The almost square rectangle packing problem involves packing all rectangles with sizes 1 × 2 to n × (n + 1) (almost squares) into an enclosing rectangle of minimal area...
Helmut Simonis, Barry O'Sullivan