Sciweavers

868 search results - page 4 / 174
» A general compression algorithm that supports fast searching
Sort
View
ICMCS
2008
IEEE
138views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Using H.264 coded block patterns for fast inter-mode selection
The support of variable block-sizes, though significantly improves the compression efficiency, imposes a big computational challenge on an H.264 encoder. In this paper, we present...
Bo-Yuan Chen, Shih-Hsuan Yang
HSNMC
2004
Springer
172views Multimedia» more  HSNMC 2004»
14 years 29 days ago
Fast Update Algorithm for IP Forwarding Table Using Independent Sets
This paper describes a new update algorithm for Internet Protocol (IP) forwarding tables. The update algorithm is so general that it can be combined with many IP address lookup alg...
Xuehong Sun, Sartaj K. Sahni, Yiqiang Q. Zhao
USENIX
2001
13 years 9 months ago
Fast Indexing: Support for Size-Changing Algorithms in Stackable File Systems
Stackable file systems can provide extensible file system functionality with minimal performance overhead and development cost. However, previous approaches provide only limited f...
Erez Zadok, Johan M. Andersen, Ion Badulescu, Jaso...
CP
2008
Springer
13 years 9 months ago
Optimization of Simple Tabular Reduction for Table Constraints
Abstract. Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to c...
Christophe Lecoutre
CIAC
2000
Springer
118views Algorithms» more  CIAC 2000»
13 years 12 months ago
Speeding Up Pattern Matching by Text Compression
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Ma...