Sciweavers

1449 search results - page 20 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
79
Voted
ACL
1994
15 years 1 months ago
Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorit...
John Carroll
SACRYPT
2001
Springer
130views Cryptology» more  SACRYPT 2001»
15 years 4 months ago
Algorithms for Multi-exponentiation
This paper compares different approaches for computing power products 1≤i≤k gei i in finite groups. We look at the conventional simultaneous exponentiation approach and prese...
Bodo Möller
113
Voted
CHES
1999
Springer
140views Cryptology» more  CHES 1999»
15 years 4 months ago
Power Analysis Attacks of Modular Exponentiation in Smartcards
Abstract. Three new types of power analysis attacks against smartcard implementations of modular exponentiation algorithms are described. The first attack requires an adversary to ...
Thomas S. Messerges, Ezzy A. Dabbish, Robert H. Sl...
91
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Sliding window greedy RLS for sparse filters
We present a sliding window RLS for sparse filters, based on the greedy least squares algorithm. The algorithm adapts a partial QR factorization with pivoting, using a simplifie...
Alexandru Onose, Bogdan Dumitrescu, Ioan Tabus
IJCAI
2007
15 years 1 months ago
A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
Janusz Marecki, Sven Koenig, Milind Tambe