Sciweavers

24 search results - page 1 / 5
» Empirical Characterization of Discretization Error in Gradie...
Sort
View
SASO
2008
IEEE
13 years 11 months ago
Empirical Characterization of Discretization Error in Gradient-Based Algorithms
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...
Jonathan Bachrach, Jacob Beal, Joshua Horowitz, Da...
ICASSP
2010
IEEE
13 years 5 months ago
Distance-based discretization of parametric signal manifolds
The characterization of signals and images in manifolds often lead to efficient dimensionality reduction algorithms based on manifold distance computation for analysis or classi...
Elif Vural, Pascal Frossard
ICASSP
2011
IEEE
12 years 8 months ago
A complete ensemble empirical mode decomposition with adaptive noise
In this paper an algorithm based on the ensemble empirical mode decomposition (EEMD) is presented. The key idea on the EEMD relies on averaging the modes obtained by EMD applied t...
María Eugenia Torres, Marcelo A. Colominas,...
JMLR
2010
164views more  JMLR 2010»
12 years 11 months ago
Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
Nevena Lazic, Brendan J. Frey, Parham Aarabi
VMV
2001
108views Visualization» more  VMV 2001»
13 years 6 months ago
A Theoretical Comparison of Monte Carlo Radiosity Algorithms
In this paper, we present a theoretical analysis of the error with three basic Monte Carlo radiosity algorithms, based on continuous collision shooting random walks, discrete coll...
Philippe Bekaert, Hans-Peter Seidel