Sciweavers

2621 search results - page 82 / 525
» Near orders and codes
Sort
View
DCC
1996
IEEE
15 years 8 months ago
On the Implementation of Minimum-Redundancy Prefix Codes
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
Alistair Moffat, Andrew Turpin
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 4 months ago
Information Criteria and Arithmetic Codings : An Illustration on Raw Images
In this paper we give a short theoretical description of the general predictive adaptive arithmetic coding technique. The links between this technique and the works of J. Rissanen...
Guilhem Coq, Olivier Alata, Marc Arnaudon, Christi...
CORR
2011
Springer
166views Education» more  CORR 2011»
14 years 8 months ago
A family of fast-decodable MIDO codes from crossed-product algebras over Q
—Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable dev...
Laura Luzzi, Frédérique E. Oggier
ICASSP
2009
IEEE
15 years 11 months ago
Restoring punctuation and capitalization in transcribed speech
Adding punctuation and capitalization greatly improves the readability of automatic speech transcripts. We discuss an approach for performing both tasks in a single pass using a p...
Agustín Gravano, Martin Jansche, Michiel Ba...
GD
2000
Springer
15 years 8 months ago
Labeling Points with Rectangles of Various Shapes
Abstract. We deal with a map-labeling problem, named LOFL (Leftpart Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each poi...
Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyam...