Sciweavers

1942 search results - page 117 / 389
» Speeding Up XTR
Sort
View
CRYPTO
2004
Springer
126views Cryptology» more  CRYPTO 2004»
15 years 11 months ago
Compressed Pairings
Pairing-based cryptosystems rely on bilinear non-degenerate maps called pairings, such as the Tate and Weil pairings defined over certain elliptic curve groups. In this paper we s...
Michael Scott, Paulo S. L. M. Barreto
EGOV
2004
Springer
15 years 11 months ago
e-Government Intermediation
The recently proposed intermediation schemes in e-government are meant to speed up and facilitate integration and access to services offered by local and regional public sector ser...
Aljosa Pasic, Anne-Marie Sassen, Alicia Garcia
ICCS
2004
Springer
15 years 11 months ago
A Fast Multifrontal Solver for Non-linear Multi-physics Problems
The paper presents a highly optimized implementation of a multifrontal solver for linear systems arising in the FEM simulation of multi-physics problems related to the behaviour of...
Alberto Bertoldo, Mauro Bianco, Geppino Pucci
ARITH
2003
IEEE
15 years 11 months ago
Some Optimizations of Hardware Multiplication by Constant Matrices
This paper presents some improvements on the optimization of hardware multiplication by constant matrices. We focus on the automatic generation of circuits that involve constant m...
Nicolas Boullis, Arnaud Tisserand
FOCS
2003
IEEE
15 years 11 months ago
Paths, Trees, and Minimum Latency Tours
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, ...