Sciweavers

204 search results - page 10 / 41
» Powered Tate Pairing Computation
Sort
View
MOBISYS
2005
ACM
15 years 11 months ago
Shake them up!: a movement-based pairing protocol for CPU-constrained devices
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
Claude Castelluccia, Pars Mutaf
COLING
2002
14 years 11 months ago
Applying an NVEF Word-Pair Identifier to the Chinese Syllable-to-Word Conversion Problem
Syllable-to-word (STW) conversion is important in Chinese phonetic input methods and speech recognition. There are two major problems in the STW conversion: (1) resolving the ambi...
Jia-Lin Tsai, Wen-Lian Hsu
ICASSP
2011
IEEE
14 years 3 months ago
Max-min fair rate control based on a saddle-point characterization of some perron roots
We consider a power-controlled wireless network with an established network topology in which the communication links (transmitter-receiver pairs) are subject to general constrain...
Slawomir Stanczak, Michal Kaliszan, Mario Goldenba...
ECCC
1998
88views more  ECCC 1998»
14 years 11 months ago
Computational Indistinguishability: A Sample Hierarchy
We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given ...
Oded GoldreichMadhu Sudan
CODES
2008
IEEE
15 years 1 months ago
Power reduction via macroblock prioritization for power aware H.264 video applications
As the importance of multimedia applications in hand-held devices increases, the computational strain and corresponding demand for energy in such devices continues to grow. Portab...
Michael A. Baker, Viswesh Parameswaran, Karam S. C...