Sciweavers

534 search results - page 13 / 107
» One more bit is enough
Sort
View
EUROCRYPT
1999
Springer
14 years 6 days ago
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives. We introduce a general model...
Ivan Damgård, Joe Kilian, Louis Salvail
CGO
2010
IEEE
14 years 2 months ago
Integrated instruction selection and register allocation for compact code generation exploiting freeform mixing of 16- and 32-bi
For memory constrained embedded systems code size is at least as important as performance. One way of increasing code density is to exploit compact instruction formats, e.g. ARM T...
Tobias J. K. Edler von Koch, Igor Böhm, Bj&ou...
INFOCOM
2003
IEEE
14 years 1 months ago
Chaotic Maps as Parsimonious Bit Error Models of Wireless Channels
Abstract—The error patterns of a wireless digital communication channel can be described by looking at consecutively correct or erroneous bits (runs and bursts) and at the distri...
Andreas Köpke, Andreas Willig, Holger Karl
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 4 days ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
ICC
2007
IEEE
135views Communications» more  ICC 2007»
14 years 2 months ago
Two-Dimensional Generalized Partial Response Equalizer for Bit-Patterned Media
The use of bit-patterned media is one of the approaches being investigated to extend magnetic recording densities to 1 Tbit/in2 and beyond. In patterned media, track pitch may be s...
Sheida Nabavi, B. V. K. Vijaya Kumar