14515 search results - page 107 / 2903 » Efficient Embedded Computing |
CCR
2006
13 years 10 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
CHINAF
2008
13 years 10 months ago
2008
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
ECIR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The Multiple Bernoulli (MB) Language Model has been generally considered too computationally expensive for practical purposes and superseded by the more efficient multino...
ANTS
2010
Springer
14 years 1 months ago
2010
Springer
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...