Sciweavers

5904 search results - page 517 / 1181
» Requirements for a Composition Language
Sort
View
STOC
2009
ACM
224views Algorithms» more  STOC 2009»
16 years 7 months ago
3-query locally decodable codes of subexponential length
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...
Klim Efremenko
TCC
2009
Springer
133views Cryptology» more  TCC 2009»
16 years 7 months ago
Composing Quantum Protocols in a Classical Environment
We propose a general security definition for cryptographic quantum protocols that implement classical non-reactive two-party tasks. The definition is expressed in terms of simple q...
Serge Fehr, Christian Schaffner
PKC
2009
Springer
121views Cryptology» more  PKC 2009»
16 years 7 months ago
Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
Recently, the new Multibase Non-Adjacent Form (mbNAF) method was introduced and shown to speed up the execution of the scalar multiplication with an efficient use of multiple bases...
Patrick Longa, Catherine H. Gebotys
PERCOM
2009
ACM
16 years 7 months ago
Programmable Presence Virtualization for Next-Generation Context-Based Applications
Abstract--Presence, broadly defined as an event publishnotification infrastructure for converged applications, has emerged as a key mechanism for collecting and disseminating conte...
Arup Acharya, Nilanjan Banerjee, Dipanjan Chakrabo...
VLDB
2007
ACM
89views Database» more  VLDB 2007»
16 years 7 months ago
Effective Phrase Prediction
Autocompletion is a widely deployed facility in systems that require user input. Having the system complete a partially typed "word" can save user time and effort. In th...
Arnab Nandi, H. V. Jagadish