Sciweavers

1279 search results - page 90 / 256
» Fast Implementations of Automata Computations
Sort
View
IV
2006
IEEE
210views Visualization» more  IV 2006»
14 years 4 months ago
FFT and Convolution Performance in Image Filtering on GPU
Many contemporary visualization tools comprise some image filtering approach. Since image filtering approaches are very computationally demanding, the acceleration using graphic...
Ondirej Fialka, Martin Cadík
PADS
2005
ACM
14 years 3 months ago
Routing Worm: A Fast, Selective Attack Worm Based on IP Address Information
Most well-known Internet worms, such as Code Red, Slammer, and Blaster, infected vulnerable computers by scanning the entire Internet IPv4 space. In this paper, we present a new s...
Cliff Changchun Zou, Donald F. Towsley, Weibo Gong...
SIGGRAPH
1994
ACM
14 years 2 months ago
Fast volume rendering using a shear-warp factorization of the viewing transformation
Several existing volume rendering algorithms operate by factoring the viewing transformation into a 3D shear parallel to the data slices, a projection to form an intermediate but ...
Philippe Lacroute, Marc Levoy
ANCS
2009
ACM
13 years 8 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
CANPC
1998
Springer
14 years 2 months ago
The Remote Enqueue Operation on Networks of Workstations
Abstract. Modern networks of workstations connected by Gigabit networks have the ability to run high-performance computing applications at a reasonable performance, but at a signi ...
Evangelos P. Markatos, Manolis Katevenis, Penny Va...