Sciweavers

1469 search results - page 10 / 294
» Approximate polynomial decomposition
Sort
View
TSP
2008
118views more  TSP 2008»
14 years 9 months ago
Approximating Functions From Sampled Fourier Data Using Spline Pseudofilters
Recently, new polynomial approximation formulas were proposed for the reconstruction of compactly supported piecewise smooth functions from Fourier data. Formulas for zero and firs...
Ana Gabriela Martínez, Alvaro R. De Pierro
ESA
2006
Springer
118views Algorithms» more  ESA 2006»
15 years 1 months ago
Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
ESA
2009
Springer
106views Algorithms» more  ESA 2009»
15 years 4 months ago
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
Markus Bläser, Christian Hoffmann
ICASSP
2010
IEEE
14 years 9 months ago
Sound enhancement using sparse approximation with speclets
This paper addresses an innovative approach to informed enhancement of damaged sound. It uses sparse approximations with a learned dictionary of atoms modeling the main components...
Manuel Moussallam, Pierre Leveau, Si-Mohamed Aziz ...
JCT
2002
48views more  JCT 2002»
14 years 9 months ago
Forest Volume Decompositions and Abel - Cayley - Hurwitz Multinomial Expansions
This paper presents a systematic approach to the discovery, interpretation and veri cation of various extensions of Hurwitz's multinomial identities, involving polynomials de...
Jim Pitman