Sciweavers

16430 search results - page 120 / 3286
» On Computable Tree Functions
Sort
View
162
Voted
TC
2008
15 years 2 months ago
Power and Area-Efficient Unified Computation of Vector and Elementary Functions for Handheld 3D Graphics Systems
A unified computation method of vector and elementary functions is proposed for handheld 3D graphics systems. It unifies vector operations like vector multiply, multiply-and-add, d...
Byeong-Gyu Nam, Hyejung Kim, Hoi-Jun Yoo
CSFW
2008
IEEE
15 years 10 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
MIDDLEWARE
2005
Springer
15 years 9 months ago
Functional and architectural adaptation in pervasive computing environments
Service-oriented computing paradigm encourages the use of dynamic binding of application requirements to the resources needed to fulfill application tasks. Especially in pervasive...
Nanjangud C. Narendra, Umesh Bellur, S. K. Nandy, ...
123
Voted
JAT
2006
64views more  JAT 2006»
15 years 3 months ago
Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm
Opposed to linear schemes, nonlinear function approximation allows to obtain a dimension independent rate of convergence. Unfortunately, in the presence of data noise typical algo...
Andreas Hofinger
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
15 years 6 months ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert