4315 search results - page 47 / 863 » Sorting in linear time |
COMPGEOM
1993
ACM
13 years 11 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
NAACL
2003
13 years 9 months ago
2003
We present improvements to a greedy decoding algorithm for statistical machine translation that reduce its time complexity from at least cubic ( ¢¡¤£¦¥¨§ when applied na...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an ...
VTC
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— This paper proposes a maximum likelihood detection (MLD) method for the differential space-time block code (DSTBC) in cooperation with blind linear prediction (BLP) of ...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...