Sciweavers

1201 search results - page 65 / 241
» Exact Analysis of Exact Change
Sort
View
TIT
2002
120views more  TIT 2002»
13 years 7 months ago
Finite-length analysis of low-density parity-check codes on the binary erasure channel
In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expr...
Changyan Di, David Proietti, Ì. Emre Telata...
MONET
2011
13 years 2 months ago
Mathematical Analysis of Throughput Bounds in Random Access with ZigZag Decoding
— We investigate the throughput improvement that ZIGZAG decoding (Gollakota and Katabi (2008)) can achieve in multi-user random access systems. ZIGZAG is a recently proposed 802....
Jeongyeup Paek, Michael J. Neely
INTERSPEECH
2010
13 years 2 months ago
Direct observation of pruning errors (DOPE): a search analysis tool
The search for the optimal word sequence can be performed efficiently even in a speech recognizer with a very large vocabulary and complex models. This is achieved using pruning m...
Volker Steinbiss, Martin Sundermeyer, Hermann Ney
ICASSP
2011
IEEE
12 years 11 months ago
Bias analysis of the forced choice detection test for Rayleigh/Rician statistics
For Rayleigh/Rician statistics at the decision device, the probability of correct decision in the forced choice (FC) hypothesis test is given in terms of a closed-form finite ser...
Graham W. Pulford
ICML
2006
IEEE
14 years 8 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke