Sciweavers

875 search results - page 51 / 175
» Linear Manifold Clustering
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 4 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
FGR
2000
IEEE
181views Biometrics» more  FGR 2000»
15 years 8 months ago
Face Detection Using Mixtures of Linear Subspaces
We present two methods using mixtures of linear subspaces for face detection in gray level images. One method uses a mixture of factor analyzers to concurrently perform clustering...
Ming-Hsuan Yang, Narendra Ahuja, David J. Kriegman
CSDA
2007
100views more  CSDA 2007»
15 years 4 months ago
Estimation in a linear multivariate measurement error model with a change point in the data
A linear multivariate measurement error model AX = B is considered. The errors in A B are row-wise finite dependent, and within each row, the errors may be correlated. Some of th...
Alexander Kukush, Ivan Markovsky, Sabine Van Huffe...
NPL
2000
88views more  NPL 2000»
15 years 3 months ago
Learning Synaptic Clusters for Nonlinear Dendritic Processing
Nonlinear dendritic processing appears to be a feature of biological neurons and would also be of use in many applications of artificial neural networks. This paper presents a mod...
Michael W. Spratling, Gillian Hayes
ETS
2006
IEEE
119views Hardware» more  ETS 2006»
15 years 10 months ago
On-Chip Test Generation Using Linear Subspaces
A central problem in built-in self test (BIST) is how to efficiently generate a small set of test vectors that detect all targeted faults. We propose a novel solution that uses l...
Ramashis Das, Igor L. Markov, John P. Hayes