17. SPIRE 2010: Los Cabos, Mexico
Edgar Chávez, Stefano Lonardi (Eds.): String Processing and Information Retrieval - 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings. Springer 2010 Lecture Notes in Computer Science ISBN 978-3-642-16320-3
Crowdsourcing and Recommendation
- Marc Najork: Querying the Web Graph - (Invited Talk). 1-12
- Daniele Broccolo, Ophir Frieder, Franco Maria Nardini, Raffaele Perego, Fabrizio Silvestri: Incremental Algorithms for Effective and Efficient Query Recommendation. 13-24
- Yoram Bachrach, Ralf Herbrich: Fingerprinting Ratings for Collaborative Filtering - Theoretical and Empirical Analysis. 25-36
- Franco Maria Nardini, Fabrizio Silvestri, Hossein Vahabi, Pedram Vahabi, Ophir Frieder: On Tag Spell Checking. 37-42
Indexes and Compressed Indexes
- Diego Arroyuelo, Senén González, Mauricio Oyarzún: Compressed Self-indices Supporting Conjunctive Queries on Document Collections. 43-54
- Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter: String Retrieval for Multi-pattern Queries. 55-66
- Travis Gagie, Gonzalo Navarro, Simon J. Puglisi: Colored Range Queries and Document Retrieval. 67-81
Theory
- Luís M. S. Russo: Multiplication Algorithms for Monge Matrices. 94-105
- Christina Boucher, Kathleen Wilkie: Why Large Closest String Instances Are Easy to Solve in Practice. 106-117
- Amihood Amir, Alberto Apostolico, Gad M. Landau, Oren Sar Shalom: A PTAS for the Square Tiling Problem. 118-126
String Algorithms I
- Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Counting and Verifying Maximal Palindromes. 135-146
- Pierre Peterlongo, Nicolas Schnel, Nadia Pisanti, Marie-France Sagot, Vincent Lacroix: Identifying SNPs without a Reference Genome by Comparing Raw Reads. 147-158
Compression
- Takashi Uemura, Satoshi Yoshida, Takuya Kida, Tatsuya Asai, Seishi Okamoto: Training Parse Trees for Efficient VF Coding. 179-184
- Atsuyoshi Nakamura, Tomoya Saito, Ichigaku Takigawa, Hiroshi Mamitsuka, Mineichi Kudo: Algorithms for Finding a Minimum Repetition Representation of a String. 185-190
- Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter: Faster Compressed Dictionary Matching. 191-200
- Shanika Kuruppu, Simon J. Puglisi, Justin Zobel: Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval. 201-206
Querying and Search User Experience
- Georges Dupret, Ricardo Zilleruelo-Ramos, Sumio Fujita: Using Related Queries to Improve Web Search Results Ranking. 213-224
- Joaquín Pérez-Iglesias, Lourdes Araujo: Evaluation of Query Performance Prediction Methods by Range. 225-236
- Alexandre P. Francisco, Ricardo A. Baeza-Yates, Arlindo L. Oliveira: Mining Large Query Induced Graphs towards a Hierarchical Query Folksonomy. 237-242
String Algorithms II
- Effat Farhana, Jannatul Ferdous, Tanaeem M. Moosa, M. Sohel Rahman: Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems. 243-249
- Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen: Extracting Powers and Periods in a String from Its Runs Structure. 258-269
- Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa: On Shortest Common Superstring and Swap Permutations. 270-278
Document Analysis and Comparison
- Wladmir C. Brandão, Edleno Silva de Moura, Altigran Soares da Silva, Nivio Ziviani: A Self-Supervised Approach for Extraction of Attribute-Value Pairs from Wikipedia Articles. 279-289
- Omar Alonso, Michael Gertz, Ricardo A. Baeza-Yates: Temporal Analysis of Document Collections: Framework and Applications. 290-296
- Sergio Jimenez, Fabio Gonzalez, Alexander F. Gelbukh: Text Comparison Using Soft Cardinality. 297-302
- Felipe Bravo-Marquez, Gaston L'Huillier, Sebastián A. Ríos, Juan D. Velásquez: Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval. 303-308
Compressed Indexes
- Enno Ohlebusch, Simon Gog, Adrian Kügel: Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. 347-358
- Maxime Crochemore, German Tischler: The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching. 359-364
String Matching
- Alberto Apostolico, Péter L. Erdös, Alpár Jüttner: Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract). 365-371
- Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura: Fast Bit-Parallel Matching for Network and Regular Expressions. 372-384
- Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind: String Matching with Variable Length Gaps. 385-394
- Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat: Approximate String Matching with Stuck Address Bits. 395-405
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team