Sciweavers

312 search results - page 19 / 63
» Iterative compression and exact algorithms
Sort
View
NPL
2006
100views more  NPL 2006»
13 years 9 months ago
Constrained Projection Approximation Algorithms for Principal Component Analysis
Abstract. In this paper we introduce a new error measure, integrated reconstruction error (IRE) and show that the minimization of IRE leads to principal eigenvectors (without rotat...
Seungjin Choi, Jong-Hoon Ahn, Andrzej Cichocki
ECML
2006
Springer
14 years 1 months ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
ICIP
2008
IEEE
14 years 11 months ago
Nonconvex compressive sensing and reconstruction of gradient-sparse images: Random vs. tomographic Fourier sampling
Previous compressive sensing papers have considered the example of recovering an image with sparse gradient from a surprisingly small number of samples of its Fourier transform. T...
Rick Chartrand
ISMB
1998
13 years 11 months ago
Compression of Strings with Approximate Repeats
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
Lloyd Allison, Timothy Edgoose, Trevor I. Dix
AIPS
2008
14 years 4 days ago
Bounded-Parameter Partially Observable Markov Decision Processes
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...
Yaodong Ni, Zhi-Qiang Liu