String Processing and Information Retrieval 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Nascimento, Mario A. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Moura, Edleno S. de (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Oliveira, Arlindo L. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2857
• Θέματα: Software engineering.; Information storage and retrieval.; Data structures (Computer science).; Algorithms.; Database management.; Software Engineering/Programming and Operating Systems.; Information Storage and Retrieval.; Data Structures.; Data Structures and Information Theory.; Algorithm Analysis and Problem Complexity.; Database Management.

This volume of the Lecture Notes in Computer Science series provides a c- prehensive, state-of-the-art survey of recent advances in string processing and information retrieval. It includes invited and research papers presented at the 10th International Symposium on String Processing and Information...

Πίνακας περιεχομένων:

• Invited Papers
• Patterns on the Web
• Current Challenges in Bioinformatics
• Web Algorithms
• What's Changed? Measuring Document Change in Web Crawling for Search Engines
• Link Information as a Similarity Measure in Web Classification
• A Three Level Search Engine Index Based in Query Log Distribution
• Bit-Parallel Algorithms
• Row-wise Tiling for the Myers' Bit-Parallel Approximate String Matching Algorithm
• Alternative Algorithms for Bit-Parallel String Matching
• Bit-Parallel Approximate String Matching Algorithms with Transposition
• Compression
• Processing of Huffman Compressed Texts with a Super-Alphabet
• (S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases
• Linear-Time Off-Line Text Compression by Longest-First Substitution
• SCM: Structural Contexts Model for Improving Compression in Semistructured Text Databases
• Categorization and Ranking
• Ranking Structured Documents Using Utility Theory in the Bayesian Network Retrieval Model
• An Empirical Comparison of Text Categorization Methods
• Improving Text Retrieval in Medical Collections Through Automatic Categorization
• Music Retrieval
• A Bit-Parallel Suffix Automaton Approach for (?,?)-Matching in Music Retrieval
• Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval
• Multilingual Information Retrieval
• FindStem: Analysis and Evaluation of a Turkish Stemming Algorithm
• Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants
• The Implementation and Evaluation of a Lexicon-Based Stemmer
• French Noun Phrase Indexing and Mining for an Information Retrieval System
• Subsequences and Distributed Algorithms
• New Refinement Techniques for Longest Common Subsequence Algorithms
• The Size of Subsequence Automaton
• Distributed Query Processing Using Suffix Arrays
• Algorithms on Strings and Trees
• BFT: Bit Filtration Technique for Approximate String Join in Biological Databases
• A Practical Index for Genome Searching
• Using WordNet for Word Sense Disambiguation to Support Concept Map Construction
• Memory-Adaptative Dynamic Spatial Approximation Trees
• Large Edit Distance with Multiple Block Operations.