Sciweavers

1567 search results - page 47 / 314
» Compressing Relations and Indexes
Sort
View
TASLP
2008
75views more  TASLP 2008»
13 years 9 months ago
Efficient Index-Based Audio Matching
Given a large audio database of music recordings, the goal of classical audio identification is to identify a particular audio recording by means of a short audio fragment. Even th...
Frank Kurth, Meinard Müller
ICDE
2006
IEEE
158views Database» more  ICDE 2006»
14 years 10 months ago
Space-efficient Relative Error Order Sketch over Data Streams
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, Wei Wa...
DCC
2001
IEEE
14 years 8 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher
ISMIR
2005
Springer
137views Music» more  ISMIR 2005»
14 years 2 months ago
Extracting Quality Parameters for Compressed Audio from Fingerprints
An audio fingerprint is a compact yet very robust representation of the perceptually relevant parts of audio content. It can be used to identify audio, even when of severely dist...
Peter Jan O. Doets, Reginald L. Lagendijk
VLDB
1999
ACM
159views Database» more  VLDB 1999»
14 years 1 months ago
Aggregation Algorithms for Very Large Compressed Data Warehouses
Many efficient algorithms to compute multidimensional aggregation and Cube for relational OLAP have been developed. However, to our knowledge, there is nothing to date in the lite...
Jianzhong Li, Doron Rotem, Jaideep Srivastava