Sciweavers

1529 search results - page 11 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
DAM
2008
68views more  DAM 2008»
13 years 7 months ago
Parameterized algorithmics for linear arrangement problems
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
Henning Fernau
CVPR
2004
IEEE
14 years 9 months ago
Dual-Space Linear Discriminant Analysis for Face Recognition
Linear Discriminant Analysis (LDA) is popular feature extraction technique for face recognition. However, it often suffers from the small sample size problem when dealing with the...
Xiaogang Wang, Xiaoou Tang
APLAS
2010
ACM
13 years 5 months ago
Live Heap Space Bounds for Real-Time Systems
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
Martin Kero, Pawel Pietrzak, Johan Nordlander
CP
2009
Springer
14 years 8 months ago
Search Spaces for Min-Perturbation Repair
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
Alex S. Fukunaga
ICML
2006
IEEE
14 years 8 months ago
Null space versus orthogonal linear discriminant analysis
Dimensionality reduction is an important pre-processing step for many applications. Linear Discriminant Analysis (LDA) is one of the well known methods for supervised dimensionali...
Jieping Ye, Tao Xiong