Sciweavers

2593 search results - page 340 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
CF
2005
ACM
15 years 4 months ago
Sparse matrix storage revisited
In this paper, we consider alternate ways of storing a sparse matrix and their effect on computational speed. They involve keeping both the indices and the non-zero elements in t...
Malik Silva
129
Voted
GMAI
2006
IEEE
128views Solid Modeling» more  GMAI 2006»
15 years 8 months ago
Modeling and Rendering of DPP-Based Light Fields
Autostereoscopic displays are a subject of recent research efforts in Computer Graphics. Such displays have to be fed graphics information in order to produce spatial images. This...
Miguel Escrivá Gregori, Alejandro Domingo, ...
INFOVIS
2005
IEEE
15 years 8 months ago
Voronoi Treemaps
Treemaps are a well-known method for the visualization of attributed hierarchical data. Previously proposed Treemap layout algorithms are limited to rectangular shapes, which caus...
Michael Balzer, Oliver Deussen
HPCC
2005
Springer
15 years 8 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
IPPS
2008
IEEE
15 years 8 months ago
On the representation and multiplication of hypersparse matrices
Multicore processors are marking the beginning of a new era of computing where massive parallelism is available and necessary. Slightly slower but easy to parallelize kernels are ...
Aydin Buluç, John R. Gilbert