Sciweavers

470 search results - page 58 / 94
» Indexing Circular Patterns
Sort
View
ACSC
2000
IEEE
14 years 1 months ago
Needles and Haystacks: A Search Engine for Personal Information Collections
Information retrieval systems can be partitioned into two main classes: large-scale systems that make use of an inverted index or some other auxiliary data structure, intended for...
Owen de Kretser, Alistair Moffat
CINQ
2004
Springer
180views Database» more  CINQ 2004»
14 years 24 days ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann
FSTTCS
2000
Springer
14 years 19 days ago
Text Sparsification via Local Maxima
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Gr...
SPIESR
1996
122views Database» more  SPIESR 1996»
13 years 10 months ago
Retrieval by Content in Symbolic-Image Databases
Two approaches for integrating images into the framework of a database management system are presented. The classi cation approach preprocesses all images and attaches a semantic ...
Aya Soffer, Hanan Samet
IR
2008
13 years 9 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira