Sciweavers

2621 search results - page 31 / 525
» Near orders and codes
Sort
View
CAIP
2001
Springer
14 years 1 months ago
A Simple Algorithm for Ordering and Compression of Vector Codebooks
The problem of storage or transmission of codevectors is an essential issue in vector quantization with custom codebook. The proposed technique for compression of codebooks relies ...
Maciej Bartkowiak, Adam Luczak
CODES
2000
IEEE
14 years 27 days ago
Storage requirement estimation for data intensive applications with partially fixed execution ordering
In this paper, we propose a novel storage requirement estimation methodology for use in the early system design phases when the data transfer ordering is only partly fixed. At tha...
Per Gunnar Kjeldsberg, Francky Catthoor, Einar J. ...
PCI
2005
Springer
14 years 2 months ago
Initial Experiences Porting a Bioinformatics Application to a Graphics Processor
Bioinformatics applications are one of the most relevant and compute-demanding applications today. While normally these applications are executed on clusters or dedicated parallel ...
Maria Charalambous, Pedro Trancoso, Alexandros Sta...
LCPC
2000
Springer
14 years 2 days ago
Compiling Data Intensive Applications with Spatial Coordinates
Abstract. Processing and analyzing large volumes of data plays an increasingly important role in many domains of scienti c research. We are developing a compiler which processes da...
Renato Ferreira, Gagan Agrawal, Ruoming Jin, Joel ...
EUROSIM
1996
13 years 9 months ago
Parallel algorithms for MPEG video compression with PVM
This paper presents parallel algorithms for MPEG video compression by using the PVM library. Because of the huge amount of computation, a sequential software encoder is slow at th...
Sándor Bozoki, S. J. P. Westen, Reginald L....