Sciweavers

6142 search results - page 342 / 1229
» The Complexity of Partition Functions
Sort
View
EURODAC
1995
IEEE
131views VHDL» more  EURODAC 1995»
15 years 10 months ago
System level design, a VHDL based approach
A hierarchical system design flow was developed to facilitate concurrent development and Time-to-Market reductions. The system design flow provides for codesign of (embedded) driv...
Joris van den Hurk, Edwin Dilling
ADCM
2011
15 years 1 months ago
Approximation properties of the Generalized Finite Element Method
In this paper, we have obtained an approximation result in the Generalized Finite Element Method (GFEM) that reflects the global approximation property of the Partition of Unity ...
C. Anitescu, U. Banerjee
IACR
2011
149views more  IACR 2011»
14 years 6 months ago
Improved zero-sum distinguisher for full round Keccak-f permutation
Keccak is one of the five hash functions selected for the final round of the SHA-3 competition and its inner primitive is a permutation called Keccakf. In this paper, we find t...
Ming Duan, Xuejia Lai
FSE
2008
Springer
177views Cryptology» more  FSE 2008»
15 years 8 months ago
MD4 is Not One-Way
MD4 is a hash function introduced by Rivest in 1990. It is still used in some contexts, and the most commonly used hash function (MD5, SHA-1, SHA-2) are based on the design princip...
Gaëtan Leurent
169
Voted
LSSC
2005
Springer
16 years 5 days ago
On Weighted Structured Total Least Squares
In this contribution we extend our previous results on the structured total least squares problem to the case of weighted cost functions. It is shown that the computational complex...
Ivan Markovsky, Sabine Van Huffel