1567 search results - page 137 / 314 » Compressing Relations and Indexes |
176
click to vote
CPM
2005
Springer
15 years 11 months ago
2005
Springer
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
183
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the use of wavelet transformations as a dimensionality reduction technique to permit efficient similarity search over high-dimensional time-series data. While numerou...
155
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
207
click to vote
MM
1994
ACM
15 years 10 months ago
1994
ACM
In this paper we propose a technique for segmenting images by texture content with application to indexing images in a large image database. Using a quad-tree decomposition, textu...
147
click to vote
EDBT
2010
ACM
15 years 9 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...