1114 search results - page 100 / 223 » Optimizing XML Compression |
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
VIS
2003
IEEE
14 years 11 months ago
2003
IEEE
In this paper, we present a space efficient algorithm for speeding up isosurface extraction. Even though there exist algorithms that can achieve optimal search performance to iden...
PODS
2006
ACM
14 years 10 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
ICIP
2005
IEEE
14 years 11 months ago
2005
IEEE
Semi-fragile watermarking can be used to detect illegal and local manipulation of images, while being robust towards legal manipulations such as lossy compression. This paper desc...
ACSAC
2003
IEEE
14 years 3 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...