Sciweavers

272 search results - page 42 / 55
» The compressed permuterm index
Sort
View
82
Voted
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 4 months ago
Computing label-constraint reachability in graph databases
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...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
MM
1994
ACM
143views Multimedia» more  MM 1994»
15 years 3 months ago
Quad-Tree Segmentation for Texture-Based Image Query
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...
Jonathan M. Smith, Shih-Fu Chang
EDBT
2010
ACM
155views Database» more  EDBT 2010»
15 years 3 months ago
Suffix tree construction algorithms on modern hardware
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...
Dimitris Tsirogiannis, Nick Koudas
TIP
2010
132views more  TIP 2010»
14 years 10 months ago
Compress Compound Images in H.264/MPGE-4 AVC by Exploiting Spatial Correlation
—Compound images are a combination of text, graphics and natural image. They present strong anisotropic features, especially on the text and graphics parts. These anisotropic fea...
Cuiling Lan, Guangming Shi, Feng Wu
CORR
2011
Springer
181views Education» more  CORR 2011»
14 years 6 months ago
Compressed String Dictionaries
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
Nieves R. Brisaboa, Rodrigo Cánovas, Miguel...