Sciweavers

1390 search results - page 139 / 278
» On the Algebraic Structure of Convergence
Sort
View
MCMASTER
1993
15 years 10 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
15 years 8 months ago
Implicit Factoring with Shared Most Significant and Middle Bits
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
Jean-Charles Faugère, Raphaël Marinier...
CASCON
1996
111views Education» more  CASCON 1996»
15 years 7 months ago
A hybrid process for recovering software architecture
A large portion of the software used in industry today is legacy software. Legacy systems often evolve into dicult to maintain systems whose original design has been lost or else ...
Vassilios Tzerpos, Richard C. Holt
IJACTAICIT
2010
121views more  IJACTAICIT 2010»
15 years 1 months ago
Separation and Equalization of Cross-Coupled Signals by Adaptive Cancellation
This paper describes an adaptive noise cancellation structure suitable for the separation and equalization of signals that coupled due to the approximate placing of primary and au...
Manal Jamil Al-Kindi
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 6 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen