968 search results - page 6 / 194 » A faster implementation of APlace |
PKC
2010
Springer
13 years 11 months ago
2010
Springer
Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restric...
ADC
2008
Springer
14 years 1 months ago
2008
Springer
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
ARITH
1993
IEEE
13 years 11 months ago
1993
IEEE
An attractive paradigm for building fast numerical algorithms is the following: 1 try a fast but occasionally unstable algorithm, 2 test the accuracy of the computed answer, a...
JSA
2000
13 years 7 months ago
2000
This paper presents an efficient routing and flow control mechanism to implement multidestination message passing in wormhole networks.It is targeted to situations where the size ...
ICNP
2007
IEEE
14 years 1 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...