60 search results - page 11 / 12 » Random Order m-ary Exponentiation |
ISAAC
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
CRYPTO
2004
Springer
14 years 4 months ago
2004
Springer
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
PE
2010
Springer
13 years 9 months ago
2010
Springer
We consider a push pull queueing system with two servers and two types of jobs which are processed by the two servers in opposite order, with stochastic generally distributed proc...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
CPAIOR
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...