Sciweavers

1362 search results - page 92 / 273
» Means, Correlations and Bounds
Sort
View
IWMM
2009
Springer
122views Hardware» more  IWMM 2009»
16 years 28 days ago
Parametric heap usage analysis for functional programs
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
Leena Unnikrishnan, Scott D. Stoller
GLOBECOM
2008
IEEE
16 years 25 days ago
Two-Hop Secure Communication Using an Untrusted Relay: A Case for Cooperative Jamming
—We consider a source-destination pair that can communicate only through an unauthenticated intermediate relay node. In this two-hop communication scenario, where the cooperation...
Xiang He, Aylin Yener
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
15 years 10 months ago
Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
A fundamental privacy problem in the client-server setting is the retrieval of a record from a database maintained by a server so that the computationally bounded server remains ob...
Jens Groth, Aggelos Kiayias, Helger Lipmaa
ANSS
1991
IEEE
15 years 10 months ago
Supercritical speedup
The notions of the critical path of events and critical time of an event are key concepts in analyzing the performance of a parallel discrete event simulation. The highest critica...
David R. Jefferson, Peter L. Reiher
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 10 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson