Sciweavers

42 search results - page 3 / 9
» A Binary Recursive Gcd Algorithm
Sort
View
COMSWARE
2007
IEEE
14 years 2 months ago
A Parallelization of ECDSA Resistant to Simple Power Analysis Attacks
The Elliptic Curve Digital Signature Algorithm admits a natural parallelization wherein the point multiplication step can be split in two parts and executed in parallel. Further pa...
Sarang Aravamuthan, Viswanatha Rao Thumparthy
TIT
2002
62views more  TIT 2002»
13 years 7 months ago
Maximum-likelihood binary shift-register synthesis from noisy observations
We consider the problem of estimating the feedback coefficients of a linear feedback shift register (LFSR) based on noisy observations. In the current approach, the coefficients a...
Todd K. Moon
ACIVS
2005
Springer
14 years 1 months ago
Cleaning and Enhancing Historical Document Images
In this paper we present a recursive algorithm for the cleaning and the enhancing of historical documents. Most of the algorithms, used to clean and enhance documents or transform ...
Ergina Kavallieratou, Hera Antonopoulou
VLDB
1989
ACM
88views Database» more  VLDB 1989»
13 years 11 months ago
Estimating the Size of Generalized Transitive Closures
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size...
Richard J. Lipton, Jeffrey F. Naughton
STOC
2003
ACM
98views Algorithms» more  STOC 2003»
14 years 8 months ago
On the limits of cache-obliviousness
In this paper, we present lower bounds for permuting and sorting in the cache-oblivious model. We prove that (1) I/O optimal cache-oblivious comparison based sorting is not possib...
Gerth Stølting Brodal, Rolf Fagerberg