Sciweavers

4924 search results - page 176 / 985
» Efficiency Improvement for NTRU
Sort
View
ARITH
2005
IEEE
14 years 2 months ago
Efficient Mapping of Addition Recurrence Algorithms in CMOS
Efficient adder design requires proper selection of a recurrence algorithm and its realization. Each of the algorithms: Weinberger’s, Ling’s and Doran’s were analyzed for it...
Bart R. Zeydel, Theo T. J. H. Kluter, Vojin G. Okl...
CTRSA
2009
Springer
106views Cryptology» more  CTRSA 2009»
14 years 7 days ago
Communication-Efficient Private Protocols for Longest Common Subsequence
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
EOR
2010
84views more  EOR 2010»
13 years 8 months ago
The selection efficiency of tournaments
We discuss tournaments in terms of their efficiency as probabilistic mechanisms that select high-quality alternatives ("players") in a noisy environment. We use two crit...
Dmitry Ryvkin
CCR
2006
117views more  CCR 2006»
13 years 8 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
IJCOMSYS
2008
79views more  IJCOMSYS 2008»
13 years 8 months ago
An efficient admission control for IEEE 802.11 networks based on throughput analyses of (un)saturated channel
This paper presents a novel analytical model and an efficient admission control algorithm for IEEE 802.11 DCF access mechanism. In contrast to the previous approaches that only ana...
Lidong Lin, Haohuan Fu, Weijia Jia