Sciweavers

2949 search results - page 517 / 590
» Universal Sparse Modeling
Sort
View
CTRSA
2012
Springer
285views Cryptology» more  CTRSA 2012»
12 years 4 months ago
Plaintext-Checkable Encryption
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
Sébastien Canard, Georg Fuchsbauer, Aline G...
INFOCOM
2012
IEEE
11 years 11 months ago
Toward simple criteria to establish capacity scaling laws for wireless networks
Abstract—Capacity scaling laws offer fundamental understanding on the trend of user throughput behavior when the network size increases. Since the seminal work of Gupta and Kumar...
Canming Jiang, Yi Shi, Y. Thomas Hou, Wenjing Lou,...
LICS
2012
IEEE
11 years 11 months ago
A Higher-Order Distributed Calculus with Name Creation
—This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Ste...
Adrien Piérard, Eijiro Sumii
CCS
2009
ACM
14 years 3 months ago
Keep your friends close: the necessity for updating an anomaly sensor with legitimate environment changes
Large-scale distributed systems have dense, complex code-bases that are assumed to perform multiple and inter-dependent tasks while user interaction is present. The way users inte...
Angelos Stavrou, Gabriela F. Cretu-Ciocarlie, Mich...
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
14 years 3 months ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson