Sciweavers

32545 search results - page 418 / 6509
» Data Structures and Algorithms
Sort
View
KDD
1998
ACM
159views Data Mining» more  KDD 1998»
15 years 11 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
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 8 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...
SSD
1989
Springer
62views Database» more  SSD 1989»
15 years 11 months ago
Hierarchical Spatial Data Structures
An overview is presented of the use of hierarchical spatial data structures such as the quadtree. They are based on the principle of recursive decomposition. The focus is on the r...
Hanan Samet
SIAMCOMP
2012
13 years 9 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...