Sciweavers

3038 search results - page 99 / 608
» High-Speed Function Approximation
Sort
View
93
Voted
ESANN
2004
15 years 3 months ago
Clustering functional data with the SOM algorithm
Abstract. In many situations, high dimensional data can be considered as sampled functions. We show in this paper how to implement a Self-Organizing Map (SOM) on such data by appro...
Fabrice Rossi, Brieuc Conan-Guez, Aïcha El Go...
SMC
2010
IEEE
143views Control Systems» more  SMC 2010»
15 years 28 days ago
Estimating of Bellman function via suboptimal strategies
—The paper concerns approximate dynamic decision making. It deals with solving Bellman equation to obtain the Bellman function via so-called suboptimal strategies. The suboptimal...
Jan Zeman
VALUETOOLS
2006
ACM
125views Hardware» more  VALUETOOLS 2006»
15 years 8 months ago
An approximative method for calculating performance measures of Markov processes
We present a new approximation method called value extrapolation for Markov processes with large or infinite state spaces. The method can be applied for calculating any performan...
Juha Leino, Jorma T. Virtamo
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
15 years 2 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
ICASSP
2008
IEEE
15 years 9 months ago
A new Particle Filtering algorithm with structurally optimal importance function
Bayesian estimation in nonlinear stochastic dynamical systems has been addressed for a long time. Among other solutions, Particle Filtering (PF) algorithms propagate in time a Mon...
Boujemaa Ait-El-Fquih, François Desbouvries