SPIRE2010の論文リンク集
SPIRE(String Processing and Information REtrieval)はその名のとおり文字列処理や情報検索を扱う国際会議で、特に圧縮データ構造について多数論文が投稿されているので個人的に注目している。
SPIREの論文集はSpringerより出版されている。
昨年度開催されたSPIRE2010のプログラムを以下にメモ。一部の論文はwebで公開されている。それらについてはリンクをはっておく。またweb公開されているプログラムと論文集に記載されているプログラムで差異があったが、カテゴリ分けが論文集のほうが感覚的にあっている気がしたのでそちらを採用した。
Crowdsourcing and Recommendation Querying the Web Graph(Invited Talk) 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 Palindrome 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 log induced graphs towards a 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(Invited Talk) 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
