Sciweavers

10146 search results - page 393 / 2030
» Fast FAST
Sort
View
DOCENG
2006
ACM
16 years 4 days ago
Fast and simple XML tree differencing by sequence alignment
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
Tancred Lindholm, Jaakko Kangasharju, Sasu Tarkoma
GRAPHITE
2006
ACM
16 years 4 days ago
Two-stage compression for fast volume rendering of time-varying scalar data
This paper presents a two-stage compression method for accelerating GPU-based volume rendering of time-varying scalar data. Our method aims at reducing transfer time by compressin...
Daisuke Nagayasu, Fumihiko Ino, Kenichi Hagihara
ISLPED
2006
ACM
140views Hardware» more  ISLPED 2006»
16 years 3 days ago
L-CBF: a low-power, fast counting bloom filter architecture
—An increasing number of architectural techniques rely on hardware counting bloom filters (CBFs) to improve upon the enegy, delay and complexity of various processor structures. ...
Elham Safi, Andreas Moshovos, Andreas G. Veneris
ISPD
2006
ACM
84views Hardware» more  ISPD 2006»
16 years 3 days ago
Efficient generation of short and fast repeater tree topologies
Christoph Bartoschek, Stephan Held, Dieter Rautenb...