Sciweavers

118 search results - page 7 / 24
» Bounds on mutual information for simple codes using informat...
Sort
View
IJCAI
1997
13 years 8 months ago
Combining Probabilistic Population Codes
We study the problemof statisticallycorrect inference in networks whose basic representations are population codes. Population codes are ubiquitous in the brain, and involve the s...
Richard S. Zemel, Peter Dayan
GLOBECOM
2008
IEEE
14 years 1 months ago
Queued Cooperative Wireless Networks With Rateless Codes
—Cooperative communication using rateless codes, in which the source transmits an infinite number of parity bits to the destination until the receipt of an acknowledgment, has r...
Neelesh B. Mehta, Vinod Sharma, Gaurav Bansal
ICMCS
2006
IEEE
152views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Coding Artifact Reduction using Non-Reference Block Grid Visibility Measure
In this work a new method is proposed for coding artifact reduction of MPEG compressed video sequences. The method makes use of a simple cost-effective technique that allows the b...
Ihor O. Kirenko, Remco Muijs, Ling Shao
GLOBECOM
2007
IEEE
14 years 1 months ago
Rate-Compatible Serially Concatenated Codes with Outer Extended BCH Codes
— In this paper, we propose a rate-compatible serially concatenated structure consisting of an outer linear extended BCH code and an inner recursive systematic convolutional code...
Alexandre Graell i Amat, Raphaël Le Bidan
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
14 years 22 days ago
Combining Multiple Weak Clusterings
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
Alexander P. Topchy, Anil K. Jain, William F. Punc...