Sciweavers

8 search results - page 1 / 2
» Two-Level Directory based Compression
Sort
View
DCC
2005
IEEE
14 years 4 months ago
Two-Level Directory based Compression
In this paper we present a new dictionary-based preprocessing technique and its implementation called TWRT (Two-level Word Replacing Transformation). Our preprocessor uses several...
Przemyslaw Skibinski
SPIRE
2009
Springer
13 years 11 months ago
A Two-Level Structure for Compressing Aligned Bitexts
A bitext, or bilingual parallel corpus, consists of two texts, each one in a different language, that are mutual translations. Bitexts are very useful in linguistic engineering bec...
Joaquín Adiego, Nieves R. Brisaboa, Miguel ...
MICRO
1997
IEEE
82views Hardware» more  MICRO 1997»
13 years 9 months ago
Procedure Based Program Compression
Cost and power consumption are two of the most important design factors for many embedded systems, particularly consumer devices. Products such as Personal Digital Assistants, pag...
Darko Kirovski, Johnson Kin, William H. Mangione-S...
SIGIR
2008
ACM
13 years 4 months ago
Deep classification in large-scale text hierarchies
Most classification algorithms are best at categorizing the Web documents into a few categories, such as the top two levels in the Open Directory Project. Such a classification me...
Gui-Rong Xue, Dikan Xing, Qiang Yang, Yong Yu
ICPP
2007
IEEE
13 years 11 months ago
Integrating Memory Compression and Decompression with Coherence Protocols in Distributed Shared Memory Multiprocessors
Ever-increasing memory footprint of applications and increasing mainstream popularity of shared memory parallel computing motivate us to explore memory compression potential in di...
Lakshmana Rao Vittanala, Mainak Chaudhuri