Sciweavers

3038 search results - page 320 / 608
» High-Speed Function Approximation
Sort
View
TSP
2008
178views more  TSP 2008»
15 years 6 months ago
Digital Computation of Linear Canonical Transforms
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
A. Koc, Haldun M. Özaktas, Cagatay Candan, M....
KI
2007
Springer
15 years 6 months ago
Solving Decentralized Continuous Markov Decision Problems with Structured Reward
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
Emmanuel Benazera
PR
2000
130views more  PR 2000»
15 years 6 months ago
Self-annealing and self-annihilation: unifying deterministic annealing and relaxation labeling
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
Anand Rangarajan
ADCM
1998
94views more  ADCM 1998»
15 years 6 months ago
On a vector q-d algorithm
Using the framework provided by Clifford algebras, we consider a noncommutative quotient-difference algorithm for obtaining the elements of a continued fraction corresponding to...
D. E. Roberts
IJPRAI
1998
100views more  IJPRAI 1998»
15 years 6 months ago
Obtaining The Correspondence between Bayesian and Neural Networks
We present in this paper a novel method for eliciting the conditional probability matrices needed for a Bayesian network with the help of a neural network. We demonstrate how we c...
Athena Stassopoulou, Maria Petrou