Sciweavers

530 search results - page 23 / 106
» Universal randomized switching
Sort
View
CHES
2003
Springer
88views Cryptology» more  CHES 2003»
15 years 7 months ago
A New Algorithm for Switching from Arithmetic to Boolean Masking
To protect a cryptographic algorithm against Differential Power Analysis, a general method consists in masking all intermediate data with a random value. When a cryptographic algo...
Jean-Sébastien Coron, Alexei Tchulkine
DAC
2005
ACM
15 years 3 months ago
Sign bit reduction encoding for low power applications
This paper proposes a low power technique, called SBR (Sign Bit Reduction) which may reduce the switching activity in multipliers as well as data buses. Utilizing the multipliers ...
M. Saneei, Ali Afzali-Kusha, Zainalabedin Navabi
CDC
2009
IEEE
183views Control Systems» more  CDC 2009»
15 years 5 months ago
Algorithms and stability analysis for content distribution over multiple multicast trees
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...
Xiaoying Zheng, Chunglae Cho, Ye Xia
FOCS
2000
IEEE
15 years 5 months ago
Efficient Algorithms for Universal Portfolios
A constant rebalanced portfolio is an investment strategy that keeps the same distribution of wealth among a set of stocks from day to day. There has been much work on Cover'...
Adam Kalai, Santosh Vempala
IPPS
2007
IEEE
15 years 8 months ago
Max-Min Fair Bandwidth Allocation Algorithms for Packet Switches
With the rapid development of broadband applications, the capability of networks to provide quality of service (QoS) has become an important issue. Fair scheduling algorithms are ...
Deng Pan, Yuanyuan Yang