String Processing and Information Retrieval
Editat de Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveiraen Limba Engleză Paperback – 29 sep 2003
Preț: 327.14 lei
Preț vechi: 408.92 lei
-20%
Puncte Express: 491
Carte tipărită la comandă
Livrare economică 27 iulie-10 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540201779
ISBN-10: 3540201777
Pagini: 396
Ilustrații: CCCXCVI, 384 p.
Dimensiuni: 156 x 234 x 22 mm
Greutate: 0.6 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540201777
Pagini: 396
Ilustrații: CCCXCVI, 384 p.
Dimensiuni: 156 x 234 x 22 mm
Greutate: 0.6 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.