Sciweavers

3038 search results - page 68 / 608
» High-Speed Function Approximation
Sort
View
MP
2010
172views more  MP 2010»
14 years 8 months ago
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
Simai He, Zhening Li, Shuzhong Zhang
ICML
2005
IEEE
15 years 10 months ago
A practical generalization of Fourier-based learning
This paper presents a search algorithm for finding functions that are highly correlated with an arbitrary set of data. The functions found by the search can be used to approximate...
Adam Drake, Dan Ventura
ICIP
2003
IEEE
15 years 11 months ago
Approximation of color characterization MLUTS with artificial neural networks
MLUTs used in color characterization require significant memory for embedded systems. Most tools that create device characterization maps, use MLUTs. For this reason, there is int...
Michael J. Vrhel
CAGD
2006
90views more  CAGD 2006»
14 years 9 months ago
Local hybrid approximation for scattered data fitting with bivariate splines
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
Oleg Davydov, Rossana Morandi, Alessandra Sestini
AAAI
2006
14 years 11 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...