String processing and information retrieval : 10th international symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003 : proceedings
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...
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
2857 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • 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 (eds.), Berlin, [Éditeur inconnu], 2003, 1 volume (xi-377 pages), Lecture notes in computer science, 3-540-20177-7 • String Processing and Information Retrieval, Texte imprimé, 9783662214060 |
Table des matières:
- 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 Sizeof 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.