Sciweavers

3110 search results - page 528 / 622
» On the initialization of the DNMF algorithm
Sort
View
MP
2006
110views more  MP 2006»
15 years 4 months ago
Decomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
Ted K. Ralphs, Matthew V. Galati
PAMI
2008
200views more  PAMI 2008»
15 years 4 months ago
Principal Component Analysis Based on L1-Norm Maximization
In data-analysis problems with a large number of dimension, principal component analysis based on L2-norm (L2PCA) is one of the most popular methods, but L2-PCA is sensitive to out...
Nojun Kwak
NGC
2006
Springer
15 years 4 months ago
Story Planning as Exploratory Creativity: Techniques for Expanding the Narrative Search Space
The authoring of fictional stories is considered a creative process. The purpose of most story authoring is not to invent a new style or genre of story that will be accepted by the...
Mark O. Riedl, R. Michael Young
PAMI
2006
156views more  PAMI 2006»
15 years 4 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann
PC
2006
124views Management» more  PC 2006»
15 years 4 months ago
Message-passing code generation for non-rectangular tiling transformations
Tiling is a well known loop transformation used to reduce communication overhead in distributed memory machines. Although a lot of theoretical research has been done concerning th...
Georgios I. Goumas, Nikolaos Drosinos, Maria Athan...