Sciweavers

537 search results - page 25 / 108
» A Call to Regularity
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Boosting performance for 2D Linear Discriminant Analysis via regression
Two Dimensional Linear Discriminant Analysis (2DLDA) has received much interest in recent years. However, 2DLDA could make pairwise distances between any two classes become signiï...
Nam Nguyen, Wanquan Liu, Svetha Venkatesh
APPML
2006
80views more  APPML 2006»
13 years 7 months ago
Unicyclic graphs with exactly two main eigenvalues
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero, and it is well known that a graph has exactly one ma...
Yaoping Hou, Feng Tian
NLPRS
2001
Springer
14 years 3 days ago
Migemo: Incremental Search Method for Languages with Many Character Faces
We introduce a new incremental search method called Migemo for languages with many character faces. Migemo performs the incremental search by dynamically expanding the input patte...
Satoru Takabayashi, Hiroyuki Komatsu, Toshiyuki Ma...
IJON
2010
178views more  IJON 2010»
13 years 6 months ago
An empirical study of two typical locality preserving linear discriminant analysis methods
: Laplacian Linear Discriminant Analysis (LapLDA) and Semi-supervised Discriminant Analysis (SDA) are two recently proposed LDA methods. They are developed independently with the a...
Lishan Qiao, Limei Zhang, Songcan Chen
ARSCOM
2002
69views more  ARSCOM 2002»
13 years 7 months ago
On Deuber's partition theorem for (m, p, c)-sets
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
David S. Gunderson