Sciweavers

11121 search results - page 375 / 2225
» Computing with Continuous Change
Sort
View
162
Voted
WAIFI
2010
Springer
189views Mathematics» more  WAIFI 2010»
15 years 10 months ago
Delaying Mismatched Field Multiplications in Pairing Computations
Abstract. Miller’s algorithm for computing pairings involves performing multiplications between elements that belong to different finite fields. Namely, elements in the full e...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...
164
Voted
APNOMS
2006
Springer
15 years 8 months ago
On the Security of Attribute Certificate Structuring for Highly Distributed Computing Environments
For an efficient role based access control using attribute certificate in highly distributed computing environments, we use a technique of structuring role specification certificat...
Soomi Yang
178
Voted
SI3D
1995
ACM
15 years 8 months ago
Shadow Volume BSP Trees for Computation of Shadows in Dynamic Scenes
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...
Yiorgos Chrysanthou, Mel Slater
144
Voted
SERVICES
2008
71views more  SERVICES 2008»
15 years 6 months ago
Using Problems to Learn Service-Oriented Computing
Service-oriented computing and the ensuing science of services represent significant challenges to academia. As we come to grips with its many implications, we are slowly beginnin...
Sandeep Purao, Vijay K. Vaishnavi, John W. Bagby, ...
DLT
2006
15 years 6 months ago
Computing by Only Observing
The paradigm of evolution/observation is based on the idea that a computing device can be obtained by combining a basic system and an observer that transforms the evolution of the ...
Matteo Cavaliere, Pierluigi Frisco, Hendrik Jan Ho...