Results 251 to 260 of about 90,056 (287)

Approximating Handwritten Curve by Using Progressive-Iterative Approximation

2013 10th International Conference Computer Graphics, Imaging and Visualization, 2013
In this paper, a given handwritten curve will be approximately converted into a Bezier curve. First, a number of sampled points on the given curve are systematically chosen to guarantee that the Bezier curve can be adequately modeled without the loss of curve characteristics. These points are considered to be the Bezier control points.
Taweechai Nuntawisuttiwong, Natasha Dejdumrong   +1 more
openaire   +1 more source

Approximate 3D iterative reconstruction for SPECT

Medical Physics, 1997
Compared with slice‐by‐slice approaches for SPECT reconstruction, three‐dimensional iterative methods provide a more accurate physical model and an improved SPECT image. Clinical application of these methods, however, is limited primarily by their computational demands.
D R, Gilland, R J, Jaszczak, T A, Riauka, R E, Coleman   +3 more
openaire   +2 more sources

Monte Carlo approximation and the iterated bootstrap

Biometrika, 1994
Summary: We discuss optimal choice of the numbers of resamples in the two stages of the iterated bootstrap, when that technique is used to calibrate bootstrap confidence intervals. If the numbers of resamples in the first and second stages are denoted by \(B\) and \(C\) respectively, we show that it is optimal to take \(C\) to be approximately a ...
Booth, James G., Hall, Peter
openaire   +2 more sources

Iterative Projection Approximation Algorithms for PCA

2006 IEEE International Conference on Acoustics Speed and Signal Processing Proceedings, 2006
In this paper we introduce a new error measure, integrated reconstruction error (IRE), the minimization of which leads to principal eigenvectors (without rotational ambiguity) of the data covariance matrix. Then we present iterative algorithms for the IRE minimization, through the projection approximation.
Seungjin Choi, Jong-Hoon Ahn, Andrzej Cichocki   +2 more
openaire   +1 more source

Approximate value iteration with randomized policies

Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187), 2002
The curse of dimensionality in dynamic programming prevents, in most problems of practical interest, the exact computation of the value function. We study the fixed points of approximate value iteration, a simple algorithm that combats the curse of dimensionality by generating approximate iterates of the classical value iteration algorithm in the span ...
Daniela Pucci de Farias, Benjamin Van Roy   +1 more
openaire   +1 more source

Iterated Toeplitz approximation of covariance matrices

ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing, 2003
For a signal consisting of p complex exponentials in white noise, it is well known that the true covariance matrix will have the Hermitian Toeplitz structure and that its minimum eigenvalue will have a dimension of M-p (where M is the dimension of the matrix).
D. M. Wikes, Monson H. Hayes
openaire   +1 more source

Projections for Approximate Policy Iteration Algorithms [PDF]

, 2019
Approximate policy iteration is a class of reinforcement learning (RL) algorithms where the policy is encoded using a function approximator and which has been especially prominent in RL with continuous action spaces. In this class of RL algorithms, ensuring increase of the policy return during policy update often requires to constrain the change in ...
Akrour, R., Pajarinen, J., Neumann, Gerhard, Peters, J.   +3 more
openaire   +3 more sources

Solvability and iterative approximations for a functional equation

Journal of Global Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zeqing Liu, Jingjing Zhu, Shin Min Kang, Jeong Sheok Ume   +3 more
openaire   +1 more source

Iterative Approximations for Non-Self Operators

2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2019
The purpose of this work is to present some fixed point results, based on iteration methods, for some classes of non-self mappings. We will consider the following classes: contractions, Berinde type contractions, graphic contractions and Hardy-Rogers type contractions.
Adrian Petrusel, Radu Trusca
openaire   +1 more source

Comment: Comparison With Iterated Laplace Approximation

Technometrics, 2012
Discussion on the approach proposed in "Bayesian Computation Using Design of Experiments-Based Interpolation Technique."
openaire   +1 more source