نتایج جستجو برای: acceleration techniques

تعداد نتایج: 672074  

Journal: :Computers & Graphics 1998
Ming Wan Steve Bryson Arie E. Kaufman

ÐSeveral e€ective acceleration techniques for volume rendering o€er ecient means to skip over empty space, providing signi®cant speedup without a€ecting image quality. The e€ectiveness of such an approach depends on its ability to accurately estimate the object boundary inside a volume with minimal computational overhead. We propose a novel boundary cell-based acceleration technique for ray ca...

2002
U. Yurtsever D. Strekalov J. P. Dowling

A quantum gravity-gradiometer consists of two spatially separated ensembles of atoms interrogated by pulses of a common laser beam. The laser pulses cause the probability amplitudes of atomic ground-state hyperfine levels to interfere, producing two, motion-sensitive, phase shifts, which allow the measurement of the average acceleration of each ensemble, and, via simple differencing, of the acc...

Journal: :J. Symb. Comput. 2012
Peter Schrammel Bertrand Jeannet

Acceleration methods are commonly used for computing precisely the effects of loops in the reachability analysis of counter machine models. Applying these methods on synchronous dataflow programs, e.g. Lustre programs, requires to deal with the non-deterministic transformations due to numerical input variables. In this article we address this problem by extending the concept of abstract acceler...

2006
Sébastien Bardin Jérôme Leroux Gérald Point

Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast implements several innovative techniques such as acceleration and circuit selection to solve this problem in practice. In its latest version, the tool is built upon an open architecture: the Presburger library is man...

1999
Nicol N. Schraudolph

Almeida et al. have recently proposed online algorithms for local step size adaptation in nonlinear systems trained by gradient descent. Here we develop an alternative to their approach by extending Sutton’s work on linear systems to the general, nonlinear case. The resulting algorithms are computationally little more expensive than other acceleration techniques, do not assume statistical indep...

2013
Patrik Axelsson Mikael Norrlöf Rickard Karlsson

State estimation of a flexible industrial manipulator is presented using experimental data. The problem is formulated in a Bayesian framework where the extended Kalman filter and particle filter are used. The filters use the joint positions on the motor side of the gearboxes as well as the acceleration at the end-effector as measurements and estimates the corresponding joint angles on the arm s...

1997
JAN JANSSEN

Waveform relaxation is a numerical method for solving large-scale systems of ordinary differential equations on parallel computers. It differs from standard iterative methods in that it computes the solution on many time levels or along a continuous time interval simultaneously. This paper deals with the acceleration of the standard waveform relaxation method by successive overrelaxation (SOR) ...

Journal: :CoRR 2014
Zhenwen Dai Andreas C. Damianou James Hensman Neil D. Lawrence

In this work, we present an extension of Gaussian process (GP) models with sophisticated parallelization and GPU acceleration. The parallelization scheme arises naturally from the modular computational structure w.r.t. datapoints in the sparse Gaussian process formulation. Additionally, the computational bottleneck is implemented with GPU acceleration for further speed up. Combining both techni...

2000
Valerio Faraoni

The nonminimal coupling (NMC) of the scalar field to the Ricci curvature is unavoidable in many cosmological scenarios. Inflation and quintessence models based on nonminimally coupled scalar fields are studied, with particular attention to the balance between the scalar potential and the NMC term ξRφ2/2 in the action. NMC makes acceleration of the universe harder to achieve for the usual potent...

Journal: :Statistics and computing 2011
Hua Zhou David H. Alexander Kenneth Lange

In many statistical problems, maximum likelihood estimation by an EM or MM algorithm suffers from excruciatingly slow convergence. This tendency limits the application of these algorithms to modern high-dimensional problems in data mining, genomics, and imaging. Unfortunately, most existing acceleration techniques are ill-suited to complicated models involving large numbers of parameters. The s...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید