Sciweavers

168 search results - page 15 / 34
» An Upper Bound for B2[2] Sequences
Sort
View
CORR
2006
Springer
141views Education» more  CORR 2006»
13 years 8 months ago
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input outp...
Chun-Hao Hsu, Achilleas Anastasopoulos
ISMB
1993
13 years 9 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
ACCV
2007
Springer
14 years 2 months ago
Exploiting Inter-frame Correlation for Fast Video to Reference Image Alignment
Strong temporal correlation between adjacent frames of a video signal has been successfully exploited in standard video compression algorithms. In this work, we show that the tempo...
Arif Mahmood, Sohaib Khan
AAAI
1997
13 years 9 months ago
Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
Tom Bylander
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 8 months ago
Tight Bounds on the Capacity of Binary Input random CDMA Systems
Abstract-- We consider code division multiple access communication over a binary input additive white Gaussian noise channel using random spreading. For a general class of symmetri...
Satish Babu Korada, Nicolas Macris