String Processing and Information Retrieval 16th International Symposium, SPIRE 2009 Saariselkä, Finland, August 25-27, 2009 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Karlgren, Jussi (Επιμελητής έκδοσης), Tarhio, Jorma (Επιμελητής έκδοσης), Hyyrö, Heikki (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
• Σειρά: Lecture Notes in Computer Science, 5721
• Θέματα: Computer science.; Computer programming.; Data structures (Computer science).; Computer science > Mathematics.; Data mining.; Information storage and retrieval.; Computer Science.; Information Storage and Retrieval.; Programming Techniques.; Data Mining and Knowledge Discovery.; Data Structures.; Data Structures, Cryptology and Information Theory.; Symbolic and Algebraic Manipulation.

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 o...

Πίνακας περιεχομένων:

• 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 and Theory 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.