Sciweavers

3898 search results - page 196 / 780
» On the Bit Extraction Problem
Sort
View
ICIP
2008
IEEE
16 years 4 months ago
Localization of sparse image tampering via random projections
Hashes can be used to provide authentication of multimedia contents. In the case of images, a hash can be used to detect whether the data has been modified in an illegitimate way....
Marco Tagliasacchi, Giuseppe Valenzise, Stefano Tu...
ICCAD
2008
IEEE
125views Hardware» more  ICCAD 2008»
15 years 12 months ago
A succinct memory model for automated design debugging
— In today’s complex SoC designs, verification and debugging are becoming ever more crucial and increasingly timeconsuming tasks. The prevalence of embedded memories adds to t...
Brian Keng, Hratch Mangassarian, Andreas G. Veneri...
ICCAD
2002
IEEE
143views Hardware» more  ICCAD 2002»
15 years 12 months ago
A Markov chain sequence generator for power macromodeling
In macromodeling-based power estimation, circuit macromodels are created from simulations of synthetic input vector sequences. Fast generation of these sequences with all possible...
Xun Liu, Marios C. Papaefthymiou
CHES
2007
Springer
136views Cryptology» more  CHES 2007»
15 years 9 months ago
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
Tetsuya Izu, Jun Kogure, Takeshi Shimoyama
LICS
1999
IEEE
15 years 7 months ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis