Sciweavers

4212 search results - page 137 / 843
» On Compressible Pairings and Their Computation
Sort
View
VISUALIZATION
1999
IEEE
15 years 10 months ago
Tetrahedral Mesh Compression with the Cut-Border Machine
In recent years, substantial progress has been achieved in the area of volume visualization on irregular grids, which is mainly based on tetrahedral meshes. Even moderately fine t...
Stefan Gumhold, Stefan Guthe, Wolfgang Straß...
IJIT
2004
15 years 7 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
DCC
1991
IEEE
15 years 10 months ago
New Methods for Lossless Image Compression Using Arithmetic Coding
d abstract) Paul G. Howard' and Jeffrey Scott Vitter2 Department of Computer Science Brown University Providence, R. I. 02912-1910
Paul G. Howard, Jeffrey Scott Vitter
MOMM
2009
ACM
129views Communications» more  MOMM 2009»
15 years 11 months ago
Sharing large data collections between mobile peers
New directions in the provision of end-user computing experiences mean that we need to determine the best way to share data between small mobile computing devices. Partitioning la...
Brian Tripney, Christopher Foley, Richard Gourlay,...
POPL
2010
ACM
16 years 1 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak