Sciweavers

861 search results - page 64 / 173
» Faster integer multiplication
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Optimal power allocation and joint source-channel coding for wireless DS-CDMA visual sensor networks using the Nash Bargaining S
We consider the problem of resource allocation for a Direct Sequence Code Division Multiple Access (DS-CDMA) wireless visual sensor network (VSN). We use the Nash Bargaining Solut...
Katerina Pandremmenou, Lisimachos P. Kondi, Konsta...
ITNG
2007
IEEE
14 years 4 months ago
SPA resistant Elliptic Curve Cryptosystem using Addition Chains
: There has been a lot of interest in recent years in the problems faced by cryptosystems due to side channel attacks. Algorithms for elliptic curve point scalar multiplication suc...
Andrew Byrne, Nicolas Meloni, Francis M. Crowe, Wi...
CHES
2000
Springer
114views Cryptology» more  CHES 2000»
14 years 2 months ago
Montgomery Exponentiation with no Final Subtractions: Improved Results
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
Gaël Hachez, Jean-Jacques Quisquater
OOPSLA
1995
Springer
14 years 1 months ago
Bidirectional Object Layout for Separate Compilation
Existing schemes for object layout and dispatch in the presence of multiple inheritance and separate compilation waste space and are slower than systems with single inheritance. T...
Andrew C. Myers
ICDE
2009
IEEE
163views Database» more  ICDE 2009»
14 years 12 months ago
Distance-Based Representative Skyline
Given an integer k, a representative skyline contains the k skyline points that best describe the tradeoffs among different dimensions offered by the full skyline. Although this to...
Yufei Tao, Ling Ding, Xuemin Lin, Jian Pei