604 search results - page 48 / 121 » Efficient Computation of Multiplicative Inverses for Cryptog... |
NOSSDAV
2004
Springer
14 years 1 months ago
2004
Springer
Retransmission can be used for loss recovery in continuous media applications but the number of retransmission attempts is bounded by the size of the playout buffer. For efficient...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...
ASIACRYPT
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...
FLAIRS
2004
13 years 9 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...