String Processing and Information Retrieval 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Crestani, Fabio (Επιμελητής έκδοσης), Ferragina, Paolo (Επιμελητής έκδοσης), Sanderson, Mark (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.
• Σειρά: Lecture Notes in Computer Science, 4209
• Θέματα: Computer science.; Data structures (Computer science).; Coding theory.; Algorithms.; Database management.; Information storage and retrieval.; Artificial intelligence.; Computer Science.; Information Storage and Retrieval.; Artificial Intelligence (incl. Robotics).; Database Management.; Data Structures.; Coding and Information Theory.; Algorithm Analysis and Problem Complexity.

This volume contains the papers presented at the 13th International Symposium on String Processing and Information Retrieval (SPIRE), held October 11-13, 2006, in Glasgow, Scotland. The SPIRE annual symposium provides an opportunity for both new and established researchers to present original contri...

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

• Web Clustering and Text Categorization
• MP-Boost: A Multiple-Pivot Boosting Algorithm and Its Application to Text Categorization
• TreeBoost.MH: A Boosting Algorithm for Multi-label Hierarchical Text Categorization
• Cluster Generation and Cluster Labelling for Web Snippets: A Fast and Accurate Hierarchical Solution
• Principal Components for Automatic Term Hierarchy Building
• Strings
• Computing the Minimum Approximate ?-Cover of a String
• Sparse Directed Acyclic Word Graphs
• On-Line Repetition Detection
• User Behavior
• Analyzing User Behavior to Rank Desktop Items
• The Intention Behind Web Queries
• Web Search Algorithms
• Compact Features for Detection of Near-Duplicates in Distributed Retrieval
• Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory
• Efficient Lazy Algorithms for Minimal-Interval Semantics
• Output-Sensitive Autocompletion Search
• Compression
• A Compressed Self-index Using a Ziv-Lempel Dictionary
• Mapping Words into Codewords on PPM
• Correction
• Improving Usability Through Password-Corrective Hashing
• Word-Based Correction for Retrieval of Arabic OCR Degraded Documents
• Information Retrieval Applications
• A Statistical Model of Query Log Generation
• Using String Comparison in Context for Improved Relevance Feedback in Different Text Media
• A Multiple Criteria Approach for Information Retrieval
• English to Persian Transliteration
• Bio Informatics
• Efficient Algorithms for Pattern Matching with General Gaps and Character Classes
• Matrix Tightness: A Linear-Algebraic Framework for Sorting by Transpositions
• How to Compare Arc-Annotated Sequences: The Alignment Hierarchy
• Web Search Engines
• Structured Index Organizations for High-Throughput Text Querying
• Adaptive Query-Based Sampling of Distributed Collections
• Short Papers
• Dotted Suffix Trees A Structure for Approximate Text Indexing
• Phrase-Based Pattern Matching in Compressed Text
• Discovering Context-Topic Rules in Search Engine Logs
• Incremental Aggregation of Latent Semantics Using a Graph-Based Energy Model
• A New Algorithm for Fast All-Against-All Substring Matching.