Sciweavers

1945 search results - page 69 / 389
» Speeding up Serpent
Sort
View
CASES
2006
ACM
15 years 2 months ago
High-performance packet classification algorithm for many-core and multithreaded network processor
Packet classification is crucial for the Internet to provide more value-added services and guaranteed quality of service. Besides hardware-based solutions, many software-based cla...
Duo Liu, Bei Hua, Xianghui Hu, Xinan Tang
ICIP
2002
IEEE
16 years 24 days ago
DCT approximation for low bit rate coding using a conditional transform
A transform approximation is explored for speeding up the software compression of images and video. It is used to replace the regular DCT whenever only few DCT coefficients are ac...
Ricardo L. de Queiroz
CADE
2001
Springer
15 years 11 months ago
Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics
This paper investigates optimization techniques and data structures exploiting the use of so-called pseudo models. These techniques are applied to speed up TBox and ABox reasoning ...
Anni-Yasmin Turhan, Ralf Möller, Volker Haars...
DCC
2008
IEEE
15 years 10 months ago
Huffman Coding with Non-sorted Frequencies
Abstract. A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are inves...
Shmuel Tomi Klein, Dana Shapira
SAC
2009
ACM
15 years 6 months ago
The sum-of-increments constraint in the consecutive-ones matrix decomposition problem
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
Sebastian Brand