Sciweavers

2312 search results - page 339 / 463
» The complexity of estimating min-entropy
Sort
View
AVSS
2009
IEEE
15 years 8 months ago
Object Tracking from Unstabilized Platforms by Particle Filtering with Embedded Camera Ego Motion
Visual tracking with moving cameras is a challenging task. The global motion induced by the moving camera moves the target object outside the expected search area, according to th...
Carlos R. del-Blanco, Narciso N. García, Lu...
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
15 years 8 months ago
ASAGA: an adaptive surrogate-assisted genetic algorithm
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
Liang Shi, Khaled Rasheed
ICASSP
2010
IEEE
15 years 7 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
CGF
2008
75views more  CGF 2008»
15 years 7 months ago
Extraction Of Feature Lines On Surface Meshes Based On Discrete Morse Theory
We present an approach for extracting extremal feature lines of scalar indicators on surface meshes, based on discrete Morse Theory. By computing initial Morse-Smale complexes of ...
Jan Sahner, Britta Weber, Steffen Prohaska, Hans L...
153
Voted
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 7 months ago
On Polynomial Multiplication in Chebyshev Basis
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
Pascal Giorgi