21 search results - page 4 / 5 » The Asymptotic Number of Set Partitions with Unequal Block S... |
CRYPTO
2010
Springer
13 years 7 months ago
2010
Springer
We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions ...
ICCAD
2009
IEEE
13 years 3 months ago
2009
IEEE
SRAM cell design is driven by the need to satisfy static noise margin, write margin and read current margin (RCM) over all cells in the array in an energy-efficient manner. These ...
GLOBECOM
2007
IEEE
14 years 1 days ago
2007
IEEE
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...
BMCBI
2010
13 years 6 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
COMPGEOM
2006
ACM
13 years 9 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...