String Processing and Information Retrieval: 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings: Lecture Notes in Computer Science, cartea 2857
Editat de Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveiraen Limba Engleză Paperback – 29 sep 2003
Din seria Lecture Notes in Computer Science
- 20% Preț: 1043.63 lei
- 20% Preț: 334.61 lei
- 20% Preț: 336.22 lei
- 20% Preț: 445.69 lei
- 20% Preț: 238.01 lei
- 20% Preț: 334.61 lei
- 20% Preț: 438.69 lei
- Preț: 442.03 lei
- 20% Preț: 337.87 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 634.41 lei
- 17% Preț: 427.22 lei
- 20% Preț: 643.99 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1057.10 lei
- 20% Preț: 581.55 lei
- Preț: 374.84 lei
- 20% Preț: 331.36 lei
- 15% Preț: 431.22 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1390.89 lei
- 20% Preț: 1007.16 lei
- 20% Preț: 569.54 lei
- 20% Preț: 575.48 lei
- 20% Preț: 573.59 lei
- 20% Preț: 750.35 lei
- 15% Preț: 570.71 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 347.59 lei
- 20% Preț: 576.02 lei
- Preț: 404.00 lei
- 20% Preț: 586.43 lei
- 20% Preț: 750.35 lei
- 20% Preț: 812.01 lei
- 20% Preț: 649.49 lei
- 20% Preț: 344.34 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 331.68 lei
Preț vechi: 414.60 lei
-20% Nou
Puncte Express: 498
Preț estimativ în valută:
63.50€ • 65.30$ • 52.68£
63.50€ • 65.30$ • 52.68£
Carte tipărită la comandă
Livrare economică 19 februarie-05 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540201779
ISBN-10: 3540201777
Pagini: 396
Ilustrații: CCCXCVI, 384 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.55 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540201777
Pagini: 396
Ilustrații: CCCXCVI, 384 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.55 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
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.
Caracteristici
Includes supplementary material: sn.pub/extras