412 search results - page 25 / 83 » New Set of Codes for the Maximum-Likelihood Decoding Problem |
78
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we present an alternative separable implementation of L2 -orthogonal space-time codes (STC) for continuous phase modulation (CPM). In this approach, we split the STC...
100
Voted
ACL
2010
14 years 7 months ago
2010
The Viterbi algorithm is the conventional decoding algorithm most widely adopted for sequence labeling. Viterbi decoding is, however, prohibitively slow when the label set is larg...
TIT
1998
14 years 9 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
101
click to vote
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...