Sciweavers

1270 search results - page 17 / 254
» Improving Code Density Using Compression Techniques
Sort
View
3DPVT
2002
IEEE
150views Visualization» more  3DPVT 2002»
14 years 15 days ago
Coding with ASCII: compact, yet text-based 3D content
Because of the convenience of a text-based format 3D content is often published in form of a gzipped file that contains an ASCII description of the scene graph. While compressed ...
Martin Isenburg, Jack Snoeyink
CISST
2004
186views Hardware» more  CISST 2004»
13 years 9 months ago
Colour and Shape Based Image Retrieval for CVPIC Coded Images
Abstract Compressed domain image retrieval is going to play an increasingly important role in the future. It allows the calculation of image features and hence content-based image ...
Gerald Schaefer, Simon Lieutaud
GLOBECOM
2006
IEEE
14 years 1 months ago
Investigation of Error Floors of Structured Low-Density Parity-Check Codes by Hardware Emulation
Abstract−Several high performance LDPC codes have paritycheck matrices composed of permutation submatrices. We design a parallel-serial architecture to map the decoder of any str...
Zhengya Zhang, Lara Dolecek, Borivoje Nikolic, Ven...
DCC
1996
IEEE
13 years 11 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
IPM
2008
75views more  IPM 2008»
13 years 7 months ago
Single-document and multi-document summarization techniques for email threads using sentence compression
We present two approaches to email thread summarization: Collective Message Summarization (CMS) applies a multi-document summarization approach, while Individual Message Summariza...
David M. Zajic, Bonnie J. Dorr, Jimmy J. Lin