Sciweavers

715 search results - page 19 / 143
» Second step algorithms in the Burrows-Wheeler compression al...
Sort
View
NIPS
1997
13 years 10 months ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis
SIAMSC
2010
215views more  SIAMSC 2010»
13 years 7 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
GRAPHITE
2006
ACM
14 years 2 months ago
Two-stage compression for fast volume rendering of time-varying scalar data
This paper presents a two-stage compression method for accelerating GPU-based volume rendering of time-varying scalar data. Our method aims at reducing transfer time by compressin...
Daisuke Nagayasu, Fumihiko Ino, Kenichi Hagihara
AUSAI
2007
Springer
14 years 2 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
FOCS
2009
IEEE
14 years 3 months ago
Regularity Lemmas and Combinatorial Algorithms
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
Nikhil Bansal, Ryan Williams