Sciweavers

11739 search results - page 2023 / 2348
» Slideshow: functional presentations
Sort
View
JOC
2002
99views more  JOC 2002»
15 years 6 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
Phong Q. Nguyen, Igor Shparlinski
LISP
2002
107views more  LISP 2002»
15 years 6 months ago
Dependent Types for Program Termination Verification
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
Hongwei Xi
JSAC
1998
126views more  JSAC 1998»
15 years 6 months ago
Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models
Abstract—We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (...
Frank R. Kschischang, Brendan J. Frey
MOC
1998
108views more  MOC 1998»
15 years 6 months ago
Numerical conformal mapping based on the generalised conjugation operator
Abstract. An iterative procedure for numerical conformal mapping is presented which imposes no restriction on the boundary complexity. The formulation involves two analytically equ...
Bao Cheng Li, Stavros Syngellakis
MP
1998
109views more  MP 1998»
15 years 6 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
« Prev « First page 2023 / 2348 Last » Next »