String Processing and Information Retrieval: 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings
Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira
Springer, Nov 13, 2003 - Computers - 379 pages
This book constitutes the refereed proceedings of the 10th International Symposium on String Processing and Information Retrieval, SPIRE 2003, held in Manaus, Brazil, in October 2003. The 21 revised full papers and 6 revised short papers presented together with 2 invited papers were carefully reviewed and selected from 54 submissions. The papers are organized in topical sections on Web algorithms, bit-parallel algorithms, compression, categorization and ranking, music retrieval, multilingual information retrieval, subsequences and distributed algorithms, and algorithms on strings and trees.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Current Challenges in Bioinformatics
Link Information as a Similarity Measure in Web Classification
21 other sections not shown
Other editions - View all
alphabet approach approximate string matching automaton Baeza-Yates Bayesian networks bit-parallel algorithms bit-vector BNDM bytes character cluster codeword collection common subsequence compressed text compression ratio Computer Science concept map consider corresponding database denote diagonal dictionary digrams distribution dynamic programming edit distance efficient evaluation example frequency genome headers heuristic Huffman Code hypernym improve Information Retrieval input strings k-NN language Lemma length Levenshtein edit distance lexicon LNCS matrix measure memory method Navarro node noun phrases obtained occurrences operations optimal pattern matching performance prefix preprocessing problem processor query recrawling relevant search engine sequence shift-or similarity skip-gram stemming algorithm strategy STree(w substring suffix array suffix automaton superstep symbols synset Table Tagged techniques text retrieval Text REtrieval Conference TNDM total number tree tuples values variants vector WordNet