Cantitate/Preț
Produs
Total produse
Vezi coșul
String Processing and Information Retrieval: 16th International Symposium, SPIRE 2009 Saariselkä, Finland, August 25-27, 2009 Proceedings de Jussi Karlgren

String Processing and Information Retrieval: 16th International Symposium, SPIRE 2009 Saariselkä, Finland, August 25-27, 2009 Proceedings: Lecture Notes in Computer Science, cartea 5721

Editat de Jussi Karlgren, Jorma Tarhio, Heikki Hyyrö
en Limba Engleză Paperback – 11 aug 2009
This book constitutes the refereed proceedings of the 16th String Processing and Information Retrieval Symposium, SPIRE 2009 held in Saariselkä, Finland in August 2009. The 34 revised full papers were carefully reviewed and selected from 84 submissions. The papers are organized in topical sections on algorithms on trees, compressed indexes, compression, indexing, content analysis, string algorithms and bioinformatics, string algorithms and theory, and using and understanding usage.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32513 lei

Preț vechi: 40641 lei
-20% Nou

Puncte Express: 488
Preț estimativ în valută:
6223€ • 6565$ • 5186£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642037832
ISBN-10: 3642037836
Pagini: 354
Ilustrații: XIII, 354 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.57 kg
Ediția:2009
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Algorithms on Trees.- Range Quantile Queries: Another Virtue of Wavelet Trees.- Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees.- k2-Trees for Compact Web Graph Representation.- On-Line Construction of Parameterized Suffix Trees.- Compressed Indexes.- Succinct Text Indexing with Wildcards.- A Compressed Enhanced Suffix Array Supporting Fast String Matching.- Compressed Suffix Arrays for Massive Data.- On Entropy-Compressed Text Indexing in External Memory.- Compression.- A Linear-Time Burrows-Wheeler Transform Using Induced Sorting.- Novel and Generalized Sort-Based Transform for Lossless Data Compression.- A Two-Level Structure for Compressing Aligned Bitexts.- Directly Addressable Variable-Length Codes.- Content Analysis.- Identifying the Intent of a User Query Using Support Vector Machines.- Syntactic Query Models for Restatement Retrieval.- Use of Co-occurrences for Temporal Expressions Annotation.- On-Demand Associative Cross-Language Information Retrieval.- A Comparison of Data-Driven Automatic Syllabification Methods.- Indexing.- Efficient Index for Retrieving Top-k Most Frequent Documents.- Fast Single-Pass Construction of a Half-Inverted Index.- Two-Dimensional Distributed Inverted Files.- Indexing Variable Length Substrings for Exact and Approximate Matching.- String Algorithms and Bioinformatics.- Expectation of Strings with Mismatches under Markov Chain Distribution.- Consensus Optimizing Both Distance Sum and Radius.- Faster Algorithms for Sampling and Counting Biological Sequences.- String Algorithms and Theory I.- Towards a Theory of Patches.- The Frequent Items Problem, under Polynomial Decay, in the Streaming Model.- Improved Approximation Results on the Shortest Common Supersequence Problem.- String Algorithms andTheory II.- Set Intersection and Sequence Matching.- Generalised Matching.- Practical Algorithms for the Longest Common Extension Problem.- Using and Understanding Usage.- A Last-Resort Semantic Cache for Web Queries.- A Task-Based Evaluation of an Aggregated Search Interface.- Efficient Language-Independent Retrieval of Printed Documents without OCR.- Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems.

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 16th String Processing and Information Retrieval Symposium, SPIRE 2009 held in Saariselkä, Finland in August 2009.
The 34 revised full papers were carefully reviewed and selected from 84 submissions. The papers are organized in topical sections on algorithms on trees, compressed indexes, compression, indexing, content analysis, string algorithms and bioinformatics, string algorithms and theory, and using and understanding usage.