Sciweavers

11212 search results - page 537 / 2243
» Semi-persistent Data Structures
Sort
View
JEA
2008
120views more  JEA 2008»
15 years 7 months ago
Better external memory suffix array construction
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
Roman Dementiev, Juha Kärkkäinen, Jens M...
IJDE
2007
105views more  IJDE 2007»
15 years 6 months ago
Rigorous Development of Automated Inconsistency Checks for Digital Evidence Using the B Method
Inconsistencies in various data structures, such as missing log records and modified operating system files, have long been used by intrusion investigators and forensic analysts a...
Pavel Gladyshev, Andreas Enbacka
DATAMINE
1999
113views more  DATAMINE 1999»
15 years 6 months ago
A Fast Parallel Clustering Algorithm for Large Spatial Databases
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
Xiaowei Xu, Jochen Jäger, Hans-Peter Kriegel
PKDD
2010
Springer
152views Data Mining» more  PKDD 2010»
15 years 5 months ago
CET: A Tool for Creative Exploration of Graphs
We present a tool for interactive exploration of graphs that integrates advanced graph mining methods in an interactive visualization framework. The tool enables efficient explorat...
Stefan Haun, Andreas Nürnberger, Tobias K&oum...
HICSS
2009
IEEE
113views Biometrics» more  HICSS 2009»
15 years 4 months ago
Benchmarking Technique in E-Business Using the Galileo Method
We propose a benchmarking technique that is combined with customer's cognitive structures. Customer's cognitive structures are determined using a multi-dimensional scali...
Cheul Rhee, Junghoon Moon, G. Lawrence Sanders, Yo...