Sciweavers

98 search results - page 3 / 20
» Parallel Jacobian Accumulation
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
The Characterization of Data-Accumulating Algorithms
A data-accumulating algorithm (d-algorithm for short) works on an input considered as a virtually endless stream. The computation terminates when all the currently arrived data ha...
Stefan D. Bruda, Selim G. Akl
HAPTICS
2007
IEEE
14 years 1 months ago
Transparent Rendering of Tool Contact with Compliant Environments
Transparent haptic rendering of the contact between a tool and its environment requires very frequent update of the contact forces acting on the tool. Given a rigid tool and a def...
Miguel A. Otaduy, Markus H. Gross
SNPD
2003
13 years 8 months ago
List Homomorphism with Accumulation
This paper introduces accumulation into list homomorphisms for systematic development of both efficient and correct parallel programs. New parallelizable recursive pattern called...
Kazuhiko Kakehi, Zhenjiang Hu, Masato Takeichi
ICISC
2004
120views Cryptology» more  ICISC 2004»
13 years 8 months ago
Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
Abstract. We consider the use of Jacobian coordinates for Tate pairing over general characteristics. The idea of encapsulated double-andline computation and add-and-line computatio...
Sanjit Chatterjee, Palash Sarkar, Rana Barua
ICASSP
2011
IEEE
12 years 11 months ago
Non-linear noise compensation for robust speech recognition using Gauss-Newton method
In this paper, we present the Gauss-Newton method as a unified approach to optimizing non-linear noise compensation models, such as vector Taylor series (VTS), data-driven parall...
Yong Zhao, Biing-Hwang Juang