Sciweavers

295 search results - page 49 / 59
» Compressed full-text indexes
Sort
View
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 23 days 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»
14 years 21 hour 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»
13 years 11 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
MICS
2010
137views more  MICS 2010»
13 years 6 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
CSMR
2010
IEEE
13 years 2 months ago
A Heuristic-Based Approach to Identify Concepts in Execution Traces
Abstract--Concept or feature identification, i.e., the identification of the source code fragments implementing a particular feature, is a crucial task during software understandin...
Fatemeh Asadi, Massimiliano Di Penta, Giuliano Ant...