CORR
2004
Springer
13 years 5 months ago
2004
Springer
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binarysymmetric ch...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Let ( ) denote the maximum size of a -ary code of length and distance . We study the minimum asymptotic redundancy ( ) = log ( ) as grows while and are fixed. For any and 1, long a...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Turbo coding is a powerful class of error correcting codes, which can achieve performances close to the Shannon limit. The turbo principle can be applied to the problem of side-in...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
1 The article presents an online relevancy tuning method using explicit user feedback. The author developed and tested a method of words' weights modification based on search ...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
In this lecture I discuss some aspects of MKM, Mathematical Knowledge Management, with particuar emphasis on information storage and information retrieval. MSCS: 68P20, 68T30 Key w...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We introduce new techniques for extracting, analyzing, and visualizing textual contents from instructional videos of low production quality. Using Automatic Speech Recognition, ap...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
CORR
2004
Springer
13 years 5 months ago
2004
Springer
: The semantic Web initiates new, high level access schemes to online content and applications. One area of superior need for a redefined content exploration is given by on-line ed...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with, respectively, nA and nB vertices. We define an nB