Sciweavers

412 search results - page 5 / 83
» New Set of Codes for the Maximum-Likelihood Decoding Problem
Sort
View
TIT
2008
83views more  TIT 2008»
14 years 9 months ago
Hard Problems of Algebraic Geometry Codes
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
Qi Cheng
JMLR
2010
123views more  JMLR 2010»
14 years 4 months ago
Inductive Principles for Restricted Boltzmann Machine Learning
Recent research has seen the proposal of several new inductive principles designed specifically to avoid the problems associated with maximum likelihood learning in models with in...
Benjamin Marlin, Kevin Swersky, Bo Chen, Nando de ...
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
15 years 10 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
TREC
2001
14 years 11 months ago
The Bias Problem and Language Models in Adaptive Filtering
We used the YFILTER filtering system for experiments on updating profiles and setting thresholds. We developed a new method of using language models for updating profiles that is ...
Yi Zhang 0001, James P. Callan
VTC
2006
IEEE
104views Communications» more  VTC 2006»
15 years 3 months ago
Low-Complexity Optimal Detection for Hybrid Space-Time Block Coding and Spatial Multiplexing
— The combination of space-time block codes (STBC) and spatial multiplexing (SM) schemes has the advantages of diversity gain and high data rate. For such STBC/SM hybrid systems,...
Yue Wu, Chintha Tellambura