Atjaunināt sīkdatņu piekrišanu

String Processing and Information Retrieval: 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings 2009 ed. [Mīkstie vāki]

Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 295 pages, height x width: 235x155 mm, weight: 474 g, X, 295 p., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 5280
  • Izdošanas datums: 22-Oct-2008
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540890963
  • ISBN-13: 9783540890966
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
String Processing and Information Retrieval: 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings 2009 ed.Palielināt
  • Formāts: Paperback / softback, 295 pages, height x width: 235x155 mm, weight: 474 g, X, 295 p., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 5280
  • Izdošanas datums: 22-Oct-2008
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540890963
  • ISBN-13: 9783540890966
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9783540890966.html
Keywords:
This book constitutes the refereed proceedings of the 15th International Symposium on String Processing and Information Retrieval, SPIRE 2008, held in Melbourne, Australia, in November 2008. The 25 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 54 submissions. The papers are organized in topical sections on compression and performance, information retrieval scoring and ranking, string matching techniques, self-indexing, string matching: space and practicality, information retrieval, non-standard matching, and bioinformatics.
Search Is a Solved Problem and Other Annoying Fallacies.- Approximate
Runs - Revisited.- Engineering Radix Sort for Strings.- Faster Text
Fingerprinting.- Context-Sensitive Grammar Transform: Compression and Pattern
Matching.- Improved Variable-to-Fixed Length Codes.- Term Impacts as
Normalized Term Frequencies for BM25 Similarity Scoring.- The Effect of
Weighted Term Frequencies on Probabilistic Latent Semantic Term
Relationships.- Comparison of s-gram Proximity Measures in Out-of-Vocabulary
Word Translation.- Speeding Up Pattern Matching by Text Sampling.- Mismatch
Sampling.- Sliding CDAWG Perfection.- Self-indexing Natural Language.- New
Perspectives on the Prefix Array.- Indexed Hierarchical Approximate String
Matching.- An Efficient Linear Space Algorithm for Consecutive Suffix
Alignment under Edit Distance (Short Preliminary Paper).- Run-Length
Compressed Indexes Are Superior for Highly Repetitive Sequence Collections.-
Practical Rank/Select Queries over Arbitrary Sequences.- Clique Analysis of
Query Log Graphs.- Out of the Box Phrase Indexing.- Approximated Pattern
Matching with the L 1, L 2 and L ??? Metrics.- Interchange Rearrangement: The
Element-Cost Model.- ?? Parameterized Matching.- Pattern Matching with Pair
Correlation Distance.- Some Approximations for Shortest Common
Nonsubsequences and Supersequences.- On the Structure of Small Motif
Recognition Instances.- Exact Distribution of a Spaced Seed Statistic for DNA
Homology Detection.