Sciweavers

3208 search results - page 495 / 642
» A Lower Bound for Primality
Sort
View
SSDBM
2007
IEEE
105views Database» more  SSDBM 2007»
16 years 23 days ago
Window-Oblivious Join: A Data-Driven Memory Management Scheme for Stream Join
Memory management is a critical issue in stream processing involving stateful operators such as join. Traditionally, the memory requirement for a stream join is query-driven: a qu...
Ji Wu, Kian-Lee Tan, Yongluan Zhou
VTC
2007
IEEE
16 years 23 days ago
Opportunistic Feedback Protocol for Achieving Sum-Capacity of the MIMO Broadcast Channel
—This paper presents an opportunistic feedback (OF) protocol that achieves the asymptotic sum-capacity of the fading broadcast channel (BC) with a limited amount of feedback. The...
Rajiv Agarwal, Chan-Soo Hwang, John M. Cioffi
APPROX
2007
Springer
92views Algorithms» more  APPROX 2007»
16 years 21 days ago
Sublinear Algorithms for Approximating String Compressibility
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, A...
CRYPTO
2007
Springer
109views Cryptology» more  CRYPTO 2007»
16 years 21 days ago
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quant...
Ivan Damgård, Serge Fehr, Renato Renner, Lou...
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
16 years 21 days ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz