Sciweavers

3791 search results - page 475 / 759
» Packing sets of patterns
Sort
View
DAM
2010
137views more  DAM 2010»
15 years 4 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
BMCBI
2006
183views more  BMCBI 2006»
15 years 4 months ago
Mining gene expression data by interpreting principal components
Background: There are many methods for analyzing microarray data that group together genes having similar patterns of expression over all conditions tested. However, in many insta...
Joseph C. Roden, Brandon W. King, Diane Trout, Ali...
146
Voted
CVPR
2008
IEEE
16 years 6 months ago
Semi-Supervised Discriminant Analysis using robust path-based similarity
Linear Discriminant Analysis (LDA), which works by maximizing the within-class similarity and minimizing the between-class similarity simultaneously, is a popular dimensionality r...
Yu Zhang, Dit-Yan Yeung
ECCV
2002
Springer
16 years 6 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
ICIP
2004
IEEE
16 years 6 months ago
Regularization studies on LDA for face recognition
It is well-known that the applicability of Linear Discriminant Analysis (LDA) to high-dimensional pattern classification tasks such as face recognition (FR) often suffers from the...
Juwei Lu, Konstantinos N. Plataniotis, Anastasios ...