Sciweavers

534 search results - page 7 / 107
» One more bit is enough
Sort
View
ARITH
2007
IEEE
14 years 1 months ago
Performing Advanced Bit Manipulations Efficiently in General-Purpose Processors
This paper describes a new basis for the implementation of a shifter functional unit. We present a design based on the inverse butterfly and butterfly datapath circuits that perfo...
Yedidya Hilewitz, Ruby B. Lee
CRYPTO
2008
Springer
98views Cryptology» more  CRYPTO 2008»
13 years 8 months ago
One-Time Programs
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothbl...
SYNASC
2005
IEEE
86views Algorithms» more  SYNASC 2005»
14 years 19 days ago
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursivel...
Artiom Alhazov, Rudolf Freund, Agustin Riscos-N&ua...
ICNP
2006
IEEE
14 years 1 months ago
The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design
— The BitTorrent (BT) file sharing protocol is popular due to its scalability property and the incentive mechanism to reduce free-riding. However, in designing such P2P file sh...
Bin Fan, Dah-Ming Chiu, John C. S. Lui
STRINGOLOGY
2004
13 years 8 months ago
A Note on Bit-Parallel Alignment Computation
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
Heikki Hyyrö