Sciweavers

11213 search results - page 109 / 2243
» Low-contention data structures
Sort
View
SIGCOMM
2010
ACM
15 years 4 months ago
DDE: dynamic data structure excavation
Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dyn...
Asia Slowinska, Traian Stancescu, Herbert Bos
CN
2008
110views more  CN 2008»
15 years 3 months ago
The eternal sunshine of the sketch data structure
In the past years there has been significant research on developing compact data structures for summarizing large data streams. A family of such data structures is the so-called s...
Xenofontas A. Dimitropoulos, Marc Ph. Stoecklin, P...
KDD
1998
ACM
159views Data Mining» more  KDD 1998»
15 years 8 months ago
A Robust System Architecture for Mining Semi-Structured Data
The value of extracting knowledge from semi-structured data is readily apparent with the explosion of the WWW and the advent of digital libraries. This paper proposes a versatile ...
Lisa Singh, Bin Chen, Rebecca Haight, Peter Scheue...
CCS
2009
ACM
15 years 10 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 5 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...