Sciweavers

61 search results - page 8 / 13
» On the Number of Graphical Forest Partitions
Sort
View
DCC
2000
IEEE
14 years 4 days ago
Fast Progressive Image Coding without Wavelets
We introduce a new image compression algorithm that allows progressive image reconstruction – both in resolution and in fidelity, with a fully embedded bitstream. The algorithm ...
Henrique S. Malvar
GD
1998
Springer
13 years 12 months ago
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
DCC
2010
IEEE
13 years 7 months ago
Efficient hybrid encryption from ID-based encryption
This paper deals with generic transformations from ID-based key encapsulation mechanisms (IBKEM) to hybrid public-key encryption (PKE). The best generic transformation known until...
Masayuki Abe, Yang Cui, Hideki Imai, Eike Kiltz
BMCBI
2006
95views more  BMCBI 2006»
13 years 7 months ago
A quantitative analysis of secondary RNA structure using domination based parameters on trees
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...
Teresa W. Haynes, Debra J. Knisley, Edith Seier, Y...
EGPGV
2004
Springer
214views Visualization» more  EGPGV 2004»
14 years 1 months ago
Hierarchical Visualization and Compression of Large Volume Datasets Using GPU Clusters
We describe a system for the texture-based direct volume visualization of large data sets on a PC cluster equipped with GPUs. The data is partitioned into volume bricks in object ...
Magnus Strengert, Marcelo Magallón, Daniel ...