String Processing and Information Retrieval de Edgar Chavez

String Processing and Information Retrieval: 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6393

Edgar Chavez

Stefano Lonardi

en Limba Engleză Paperback – 27 sep 2010

This book constitutes the proceedings of the 17th International Symposium on String Processing and Information Retrieval, SPIRE 2010, held in Los Cabos, Mexico, in October 2010.

The 26 long and 13 short papers presented were carefully reviewed and selected from 109 submissions. The volume also contains 2 invited talks. The papers are structured in topical sections on crowdsourcing and recommendation; indexes and compressed indexes; theory; string algorithms; compressions; querying and search user experience; document analysis and comparison; compressed indexes; and string matching.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 1043^.63 lei
20%

Preț: 334^.61 lei
20%

Preț: 336^.22 lei
20%

Preț: 445^.69 lei
20%

Preț: 238^.01 lei
20%

Preț: 334^.61 lei
20%

Preț: 438^.69 lei
Preț: 442^.03 lei
20%

Preț: 337^.87 lei
20%

Preț: 148^.66 lei
20%

Preț: 310^.26 lei
20%

Preț: 256^.27 lei
20%

Preț: 634^.41 lei
17%

Preț: 427^.22 lei
20%

Preț: 643^.99 lei
20%

Preț: 307^.71 lei
20%

Preț: 1057^.10 lei
20%

Preț: 581^.55 lei
Preț: 374^.84 lei
20%

Preț: 331^.36 lei
15%

Preț: 431^.22 lei
20%

Preț: 607^.39 lei
20%

Preț: 538^.29 lei
Preț: 389^.48 lei
20%

Preț: 326^.98 lei
20%

Preț: 1390^.89 lei
20%

Preț: 1007^.16 lei
20%

Preț: 569^.54 lei
20%

Preț: 575^.48 lei
20%

Preț: 573^.59 lei
20%

Preț: 750^.35 lei
15%

Preț: 570^.71 lei
17%

Preț: 360^.19 lei
20%

Preț: 504^.57 lei
20%

Preț: 172^.69 lei
20%

Preț: 369^.12 lei
20%

Preț: 347^.59 lei
20%

Preț: 576^.02 lei
Preț: 404^.00 lei
20%

Preț: 586^.43 lei
20%

Preț: 750^.35 lei
20%

Preț: 812^.01 lei
20%

Preț: 649^.49 lei
20%

Preț: 344^.34 lei
20%

Preț: 309^.90 lei
20%

Preț: 122^.89 lei

Cuprins

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.