Sciweavers

6142 search results - page 192 / 1229
» The Complexity of Partition Functions
Sort
View
143
Voted
CANS
2010
Springer
197views Cryptology» more  CANS 2010»
15 years 1 months ago
Near-Collisions on the Reduced-Round Compression Functions of Skein and BLAKE
The SHA-3 competition organized by NIST [1] aims to find a new hash standard as a replacement of SHA-2. Till now, 14 submissions have been selected as the second round candidates, ...
Bozhan Su, Wenling Wu, Shuang Wu, Le Dong
112
Voted
ICCSA
2003
Springer
15 years 8 months ago
Uniform Approximations for Transcendental Functions
A heuristic method to construct uniform approximations to analytic transcendental functions is developed as a generalization of the Hermite-Pad´e interpolation to infinite interv...
Serge Winitzki
121
Voted
ADCM
2004
58views more  ADCM 2004»
15 years 3 months ago
On the Representation of Band-Dominant Functions on the Sphere Using Finitely Many Bits
A band-dominant function on the Euclidean sphere embedded in Rq+1 is the restriction to this sphere of an entire function of q + 1 complex variables having a finite exponential ty...
Hrushikesh Narhar Mhaskar, Francis J. Narcowich, J...
113
Voted
ICCAD
1998
IEEE
76views Hardware» more  ICCAD 1998»
15 years 7 months ago
Functional debugging of systems-on-chip
Due to the exponential growth of both design complexity and the number of gates per pin, functional debugging has emerged as a critical step in the development of a system-on-chip...
Darko Kirovski, Miodrag Potkonjak, Lisa M. Guerra
GIS
2009
ACM
15 years 7 months ago
Dynamic network data exploration through semi-supervised functional embedding
The paper presents a framework for semi-supervised nonlinear embedding methods useful for exploratory analysis and visualization of spatio-temporal network data. The method provid...
Alexei Pozdnoukhov