120 search results - page 7 / 24 » New completeness results for lazy conditional narrowing |
BMCBI
2008
13 years 7 months ago
2008
Background: The increasing amount of published literature in biomedicine represents an immense source of knowledge, which can only efficiently be accessed by a new generation of a...
ARITH
2009
IEEE
13 years 11 months ago
2009
IEEE
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...
ASIACRYPT
2003
Springer
14 years 22 days ago
2003
Springer
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than S...
FSE
2008
Springer
13 years 9 months ago
2008
Springer
Consider the permutation S in RC4. Roos pointed out in 1995 that after the Key Scheduling Algorithm (KSA) of RC4, each of the initial bytes of the permutation, i.e., S[y] for smal...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...