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

EAN (ISBN-13): 9783642037832
ISBN (ISBN-10): 3642037836
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2009
Herausgeber: Karlgren, Jussi, Springer
354 Seiten
Gewicht: 0,579 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2009-09-14T11:17:13+02:00 (Berlin)
Detailseite zuletzt geändert am 2023-04-29T06:05:26+02:00 (Berlin)
ISBN/EAN: 9783642037832

ISBN - alternative Schreibweisen:
3-642-03783-6, 978-3-642-03783-2
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: karlgren, jussi
Titel des Buches: finland, information retrieval, august, symposium, lecture notes computer science

---

Daten vom Verlag:

Autor/in: Jussi Karlgren; Jorma Tarhio; Heikki Hyyrö
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; String Processing and Information Retrieval - 16th International Symposium, SPIRE 2009 Saariselkä, Finland, August 25-27, 2009 Proceedings
Verlag: Springer; Springer Berlin
354 Seiten
Erscheinungsjahr: 2009-08-11
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIII, 354 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Informationsrückgewinnung, Information Retrieval; Verstehen; algorithms; data analysis; data compression; data mining; graph theory; hashing; information retrieval; knowledge discovery; sorting; string matching; text mining; data structures; Information Storage and Retrieval; Programming Techniques; Data Mining and Knowledge Discovery; Data Science; Data Structures and Information Theory; Symbolic and Algebraic Manipulation; Data Warehousing; Computerprogrammierung und Softwareentwicklung; Data Mining; Wissensbasierte Systeme, Expertensysteme; Datenbanken; Algorithmen und Datenstrukturen; Informationstheorie; Mathematik für Informatiker; EA

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.