Sciweavers

41 search results - page 4 / 9
» On exact and approximate interpolation of sparse rational fu...
Sort
View
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 29 days ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...
TSP
2010
13 years 2 months ago
Quasi-interpolation by means of filter-banks
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
Gerardo Pérez-Villalón
ICASSP
2011
IEEE
12 years 11 months ago
Sparse decomposition of transformation-invariant signals with continuous basis pursuit
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
Chaitanya Ekanadham, Daniel Tranchina, Eero P. Sim...
CSDA
2008
80views more  CSDA 2008»
13 years 7 months ago
Variational Bayesian functional PCA
A Bayesian approach to analyze the modes of variation in a set of curves is suggested. It is based on a generative model thus allowing for noisy and sparse observations of curves....
Angelika van der Linde
CORR
2010
Springer
253views Education» more  CORR 2010»
13 years 7 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...