Sciweavers

7930 search results - page 480 / 1586
» Greedy in Approximation Algorithms
Sort
View
TSP
2010
15 years 1 months ago
A recursive method for the approximation of LTI systems using subband processing
Using the subband technique, an LTI system can be implemented by the composition of an analysis filterbank, followed by a transfer matrix (subband model) and a synthesis filterbank...
Damián Marelli, Minyue Fu
ICASSP
2011
IEEE
14 years 10 months ago
Approximation of pattern transformation manifolds with parametric dictionaries
The construction of low-dimensional models explaining highdimensional signal observations provides concise and efficient data representations. In this paper, we focus on pattern ...
Elif Vural, Pascal Frossard
JCB
2002
108views more  JCB 2002»
15 years 6 months ago
Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
Richard Desper, Olivier Gascuel
ICPR
2000
IEEE
16 years 8 months ago
On Gaussian Radial Basis Function Approximations: Interpretation, Extensions, and Learning Strategies
In this paper we focus on an interpretation of Gaussian radial basis functions (GRBF) which motivates extensions and learning strategies. Specifically, we show that GRBF regressio...
Mário A. T. Figueiredo
RT
1999
Springer
15 years 11 months ago
Interactive Rendering with Arbitrary BRDFs using Separable Approximations
A separable decomposition of bidirectional reflectance distributions (BRDFs) is used to implement arbitrary reflectances from point sources on existing graphics hardware. Two-dim...
Jan Kautz, Michael D. McCool