String Processing and Information Retrieval 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010, Proceedings - neues Buch

EAN (ISBN-13): 9783642163203
ISBN (ISBN-10): 3642163203
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2010
Herausgeber: Springer
408 Seiten
Gewicht: 0,640 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2008-01-15T18:00:39+01:00 (Berlin)
Buch zuletzt gefunden am 2024-11-01T10:47:34+01:00 (Berlin)
ISBN/EAN: 9783642163203

ISBN - alternative Schreibweisen:
3-642-16320-3, 978-3-642-16320-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: chavez, stefano, lona
Titel des Buches: information retrieval, october, symposium, information processing, los, chavez, mexico

---

Daten vom Verlag:

Autor/in: Edgar Chavez; Stefano Lonardi
Titel: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010, Proceedings
Verlag: Springer; Springer Berlin
408 Seiten
Erscheinungsjahr: 2010-09-27
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIV, 408 p. 81 illus.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Informationsrückgewinnung, Information Retrieval; Verstehen; Informatik; Scoring; Shortest Common Superstring; algorithms; collaborative filtering; digital libraries; filtering; fingerprint; genome; information retrieval; molecular biology; natural language processing; pattern matching; performance; statistics; visualization; Information Storage and Retrieval; Computational and Systems Biology; Data Mining and Knowledge Discovery; Database Management; Automated Pattern Recognition; Multimedia Information Systems; Data Warehousing; DV-gestützte Biologie/Bioinformatik; Data Mining; Wissensbasierte Systeme, Expertensysteme; Datenbanken; Mustererkennung; Grafische und digitale Media-Anwendungen; EA

Crowdsourcing and Recommendation.- Querying the Web Graph.- Incremental Algorithms for Effective and Efficient Query Recommendation.- Fingerprinting Ratings for Collaborative Filtering — Theoretical and Empirical Analysis.- On Tag Spell Checking.- Indexes and Compressed Indexes.- Compressed Self-indices Supporting Conjunctive Queries on Document Collections.- String Retrieval for Multi-pattern Queries.- Colored Range Queries and Document Retrieval.- Range Queries over Untangled Chains.- Theory.- Multiplication Algorithms for Monge Matrices.- Why Large Closest String Instances Are Easy to Solve in Practice.- A PTAS for the Square Tiling Problem.- On the Hardness of Counting and Sampling Center Strings.- String Algorithms I.- Counting and Verifying Maximal Palindromes.- Identifying SNPs without a Reference Genome by Comparing Raw Reads.- Dynamic Z-Fast Tries.- Improved Fast Similarity Search in Dictionaries.- Compression.- Training Parse Trees for Efficient VF Coding.- Algorithms for Finding a Minimum Repetition Representation of a String.- Faster Compressed Dictionary Matching.- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval.- Querying and Search User Experience.- Standard Deviation as a Query Hardness Estimator.- Using Related Queries to Improve Web Search Results Ranking.- Evaluation of Query Performance Prediction Methods by Range.- Mining Large Query Induced Graphs towards a Hierarchical Query Folksonomy.- String Algorithms II.- Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems.- Restricted LCS.- Extracting Powers and Periods in a String from Its Runs Structure.- On Shortest Common Superstring and Swap Permutations.- Document Analysis and Comparison.- A Self-Supervised Approach for Extraction of Attribute-Value Pairs from Wikipedia Articles.- Temporal Analysis of Document Collections: Framework and Applications.- Text Comparison Using Soft Cardinality.- Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval.- Compressed Indexes.- Dual-Sorted Inverted Lists.- CST++.- Succinct Representations of Dynamic Strings.- Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes.- The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching.- String Matching.- Parameterized Searching with Mismatches for Run-Length Encoded Strings.- Fast Bit-Parallel Matching for Network and Regular Expressions.- String Matching with Variable Length Gaps.- Approximate String Matching with Stuck Address Bits.- Erratum.- Erratum to: Range Queries over Untangled Chains.