Sciweavers

4047 search results - page 249 / 810
» The Discrete Basis Problem
Sort
View
MCS
2008
Springer
15 years 4 months ago
Dynamical low-rank approximation: applications and numerical experiments
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
Achim Nonnenmacher, Christian Lubich
IJDAR
2010
169views more  IJDAR 2010»
15 years 2 months ago
A Bayesian network for combining descriptors: application to symbol recognition
Inthispaper,weproposeadescriptorcombination method, which enables to improve significantly the recognition rate compared to the recognition rates obtained by each descriptor. This ...
Sabine Barrat, Salvatore Tabbone
JMIV
2011
135views more  JMIV 2011»
14 years 11 months ago
Periodic Plus Smooth Image Decomposition
When the Discrete Fourier Transform of an image is computed, the image is implicitly assumed to be periodic. Since there is no reason for opposite borders to be alike, the “peri...
Lionel Moisan
JSC
2011
74views more  JSC 2011»
14 years 11 months ago
Constructive homomorphisms for classical groups
Let Ω ≤ GLd(q) be a quasisimple classical group in its natural representation and let ∆ = NGLd(q)(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, poly...
Scott H. Murray, Colva M. Roney-Dougal
ICASSP
2011
IEEE
14 years 8 months ago
A Kalman-like algorithm with no requirements for noise and initial conditions
We address a Kalman-like estimator for solving universally the problems of filtering (p = 0), prediction (p > 0), and smoothing (p < 0) of discrete time-varying state-space...
Yuriy S. Shmaliy