1567 search results - page 70 / 314 » Compressing Relations and Indexes |
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table scans are becoming a larger fraction of the query p...
ANNPR
2008
Springer
13 years 11 months ago
2008
Springer
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
3DIM
2003
IEEE
14 years 23 days ago
2003
IEEE
A statistical representation of three-dimensional shapes is introduced, based on a novel four-dimensional feature. The feature parameterizes the intrinsic geometrical relation of ...
TIT
2011
13 years 4 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
CIE
2008
Springer
13 years 11 months ago
2008
Springer
Consider the problem of calculating the fractal dimension of a set X consisting of all infinite sequences S over a finite alphabet that satisfy some given condition P on the asympt...