Sciweavers

244 search results - page 8 / 49
» Compressive PCA on Graphs
Sort
View
AAAI
2008
14 years 1 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
ICVS
1999
Springer
14 years 3 months ago
Face-Tracking and Coding for Video Compression
While computing power and transmission bandwidth have both been steadily increasing over the last few years, bandwidth rather than processing power remains the primary bottleneck f...
William E. Vieux, Karl Schwerdt, James L. Crowley
DLT
2010
14 years 13 days ago
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
Abstract. It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in...
Niko Haubold, Markus Lohrey, Christian Mathissen
SDM
2007
SIAM
133views Data Mining» more  SDM 2007»
14 years 12 days ago
Change-Point Detection using Krylov Subspace Learning
We propose an efficient algorithm for principal component analysis (PCA) that is applicable when only the inner product with a given vector is needed. We show that Krylov subspace...
Tsuyoshi Idé, Koji Tsuda
ESANN
2004
14 years 11 days ago
Face Recognition Using Recurrent High-Order Associative Memories
A novel face recognition approach is proposed, based on the use of compressed discriminative features and recurrent neural classifiers. Low-dimensional feature vectors are extract...
Iulian B. Ciocoiu