968 search results - page 12 / 194 » A faster implementation of APlace |
CORR
2012
Springer
12 years 5 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
ESORICS
2012
Springer
12 years 3 days ago
2012
Springer
Abstract. Given the requirements of fast processing and the complexity of RF ranging systems, distance bounding protocols have been challenging to implement so far; only few design...
FPGA
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, we propose a technique to flexibly implement genetic algorithms for various problems on FPGAs. For the purpose, we propose a basic architecture for GA which consist...
IACR
2011
12 years 9 months ago
2011
Abstract. The Gallant-Lambert-Vanstone (GLV) method is a very ef cient technique for accelerating point multiplication on elliptic curves with e ciently computable endomorphisms. G...
SIAMCOMP
2008
13 years 9 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...