1449 search results - page 146 / 290 » Self-Randomized Exponentiation Algorithms |
155
click to vote
OTM
2005
Springer
15 years 12 months ago
2005
Springer
A composition arranges available services resulting in a defined flow of executions. Before the composition is carried out, a discovery service identifies candidate services. Th...
178
click to vote
EGH
2009
Springer
15 years 4 months ago
2009
Springer
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
163
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
159
click to vote
SIGECOM
2006
ACM
16 years 9 days ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
168
click to vote
PKC
2001
Springer
15 years 10 months ago
2001
Springer
Quite recently, in [4], a new time-memory tradeoff algorithm was presented. The original goal of this algorithm was to count the number of points on an elliptic curve, however, th...