Sciweavers

244 search results - page 16 / 49
» Fast Set Intersection in Memory
Sort
View
CCS
2005
ACM
14 years 2 months ago
Fast and automated generation of attack signatures: a basis for building self-protecting servers
Large-scale attacks, such as those launched by worms and zombie farms, pose a serious threat to our network-centric society. Existing approaches such as software patches are simpl...
Zhenkai Liang, R. Sekar
CGF
2008
150views more  CGF 2008»
13 years 9 months ago
Compact, Fast and Robust Grids for Ray Tracing
The focus of research in acceleration structures for ray tracing recently shifted from render time to time to image, the sum of build time and render time, and also the memory foo...
Ares Lagae, Philip Dutré
CG
2006
Springer
13 years 9 months ago
Interactive out-of-core isosurface visualisation in time-varying data sets
We present a combination of techniques for interactive out-of-core visualisation of isosurfaces from large timedependent data sets. We make use of an index tree, computed in a pre...
Benjamin Vrolijk, Frits H. Post
DCC
2000
IEEE
14 years 1 months ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...
GLOBECOM
2007
IEEE
14 years 3 months ago
A New Design of Bloom Filter for Packet Inspection Speedup
— Bloom filter is a space-efficient randomized data structure for group membership query. It is widely used in networking applications which involve the packet header/content i...
Yang Chen, Abhishek Kumar, Jun Xu