Sciweavers

79 search results - page 16 / 16
» Shannon Information and Kolmogorov Complexity
Sort
View
IJAR
2006
125views more  IJAR 2006»
13 years 5 months ago
Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
In many real-life situations, we know the probability distribution of two random variables x1 and x2, but we have no information about the correlation between x1 and x2; what are ...
Vladik Kreinovich, Scott Ferson
CORR
2004
Springer
144views Education» more  CORR 2004»
13 years 5 months ago
The Google Similarity Distance
Words and phrases acquire meaning from the way they are used in society, from their relative semantics to other words and phrases. For computers the equivalent of `society' is...
Rudi Cilibrasi, Paul M. B. Vitányi
CG
2006
Springer
13 years 5 months ago
Realtime automatic selection of good molecular views
The investigation of molecular structures often requires the use of graphics software to display different representations of the molecule of interest. Unfortunately, the commonly...
Pere-Pau Vázquez, Miquel Feixas, Mateu Sber...
WCNC
2008
IEEE
13 years 11 months ago
Three-Stage Serially Concatenated Codes and Iterative Center-Shifting K-Best Sphere Detection for SDM-OFDM: An EXIT Chart Aided
—Iterative K-best sphere detection (SD) and channel decoding is appealing, since it is capable of achieving a nearmaximum-a-posteriori (MAP) performance at a low complexity. Howe...
Li Wang, Lei Xu, Sheng Chen, Lajos Hanzo