Sciweavers

412 search results - page 36 / 83
» Diagonalization
Sort
View
CG
2006
Springer
13 years 9 months ago
Drawing lines by uniform packing
In this paper, we introduce a new approach to line drawing that attempts to maintain a uniform packing density of horizontal segments to diagonal segments throughout the line. Whi...
Asif-ul Haque, Mohammad Saifur Rahman, Mehedi Bakh...
IJON
2006
73views more  IJON 2006»
13 years 9 months ago
Optimal selection of time lags for TDSEP based on genetic algorithm
In this letter, a two-step learning scheme for the optimal selection of time lags is proposed for a typical temporal blind source separation (TBSS), Temporal Decorrelation source ...
Zhan-Li Sun, De-Shuang Huang, Chun-Hou Zheng, Li S...
MP
2006
93views more  MP 2006»
13 years 9 months ago
Computation of Error Bounds for P-matrix Linear Complementarity Problems
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...
Xiaojun Chen, Shuhuang Xiang
PAMI
2006
205views more  PAMI 2006»
13 years 9 months ago
Learning Outdoor Color Classification
We present an algorithm for color classification with explicit illuminant estimation and compensation. A Gaussian classifier is trained with color samples from just one training im...
Roberto Manduchi
SCL
2008
79views more  SCL 2008»
13 years 9 months ago
Stability of block-triangular stationary random matrices
The objective of this note is to prove, under certain technical conditions, that the top-Lyapunov exponent of a strictly stationary random sequence of block-triangular matrices is...
László Gerencsér, György...