Sciweavers

4542 search results - page 127 / 909
» Design patterns for data structures
Sort
View
CCS
2009
ACM
16 years 1 months ago
Robust signatures for kernel data structures
Kernel-mode rootkits hide objects such as processes and threads using a technique known as Direct Kernel Object Manipulation (DKOM). Many forensic analysis tools attempt to detect...
Brendan Dolan-Gavitt, Abhinav Srivastava, Patrick ...
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
16 years 7 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
COMPGEOM
2003
ACM
15 years 11 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
SCN
2008
Springer
136views Communications» more  SCN 2008»
15 years 6 months ago
An efficient data structure for network anomaly detection
Abstract-- Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two...
Jieyan Fan, Dapeng Wu, Kejie Lu, Antonio Nucci
HT
1997
ACM
15 years 10 months ago
Structuring and Visualising the WWW by Generalised Similarity Analysis
This paper describes a generic approach to structuring and visualising a hypertext-based information space on the WWW. This approach, called Generalised Similarity Analysis (GSA),...
Chaomei Chen