Sciweavers

45 search results - page 4 / 9
» Indexing Text with Approximate q-Grams
Sort
View
ALENEX
2007
158views Algorithms» more  ALENEX 2007»
15 years 7 months ago
Faster Filters for Approximate String Matching
We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor...
Juha Kärkkäinen, Joong Chae Na
RIDE
2002
IEEE
15 years 10 months ago
Enhancive Index for Structured Document
Structured documents, especially the XML documents, are made up of a few logical components, such as title, sections, subsections and paragraphs. The components in each structured...
Xiaoling Wang, Ji-Rong Wen, Yisheng Dong, Wenyin L...
WWW
2005
ACM
16 years 6 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan
192
Voted
HICSS
2010
IEEE
200views Biometrics» more  HICSS 2010»
15 years 7 months ago
Instability of Relevance-Ranked Results Using Latent Semantic Indexing for Web Search
1 The latent semantic indexing (LSI) methodology for information retrieval applies the singular value decomposition to identify an eigensystem for a large matrix, in which cells re...
Houssain Kettani, Gregory B. Newby
FSTTCS
2000
Springer
15 years 9 months 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...