Sciweavers

872 search results - page 64 / 175
» Extreme lower probabilities
Sort
View
106
Voted
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
15 years 4 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir
ICASSP
2010
IEEE
15 years 23 days ago
Language recognition using deep-structured conditional random fields
We present a novel language identification technique using our recently developed deep-structured conditional random fields (CRFs). The deep-structured CRF is a multi-layer CRF mo...
Dong Yu, Shizhen Wang, Zahi Karam, Li Deng
COMCOM
2004
89views more  COMCOM 2004»
15 years 13 days ago
QROUTE: an QoS-guaranteed multicast routing
In this paper, we propose QROUTE, an integrated framework for QoS-guaranteed multicast routing, in which a feasible multicast tree meeting multiple QoS constraints can be construc...
Jinquan Dai, Touchai Angchuan, Hung Keng Pung
90
Voted
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 10 months ago
Towards a communication-theoretic understanding of system-level power consumption
Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be signif...
Pulkit Grover, Kristen Ann Woyach, Anant Sahai
CORR
2011
Springer
200views Education» more  CORR 2011»
14 years 7 months ago
Beating the Gilbert-Varshamov Bound for Online Channels
In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1, . . . , xn) ∈ {0, 1}n bit by bit via a channel lim...
Ishay Haviv, Michael Langberg