Main » SPIRE » 2010 »

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

Edgar Chávez, Stefano Lonardi (Editors)


Anthology ID:
2010.spire_conference-2010
Year:
2010
Venue:
spire_conference
Publisher:
Springer
URL:
https://doi.org/10.1007/978-3-642-16321-0
DOI:
10.1007/978-3-642-16321-0
DBLP:
conf/spire/2010
BibTeX:
Download

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

doi dblp
Querying the Web Graph - (Invited Talk)
Marc Najork

doi dblp
Incremental Algorithms for Effective and Efficient Query Recommendation
Daniele Broccolo | Ophir Frieder | Franco Maria Nardini | Raffaele Perego | Fabrizio Silvestri

doi dblp
Fingerprinting Ratings for Collaborative Filtering - Theoretical and Empirical Analysis
Yoram Bachrach | Ralf Herbrich

doi dblp
On Tag Spell Checking
Franco Maria Nardini | Fabrizio Silvestri | Hossein Vahabi | Pedram Vahabi | Ophir Frieder

doi dblp
Compressed Self-indices Supporting Conjunctive Queries on Document Collections
Diego Arroyuelo | Senén González | Mauricio Oyarzún

doi dblp
String Retrieval for Multi-pattern Queries
Wing-Kai Hon | Rahul Shah | Sharma V. Thankachan | Jeffrey Scott Vitter

doi dblp
Colored Range Queries and Document Retrieval
Travis Gagie | Gonzalo Navarro | Simon J. Puglisi

doi dblp
Range Queries over Untangled Chains
Francisco Claude | J. Ian Munro | Patrick K. Nicholson

doi dblp
Multiplication Algorithms for Monge Matrices
Luís M. S. Russo

doi dblp
Why Large Closest String Instances Are Easy to Solve in Practice
Christina Boucher | Kathleen P. Wilkie

doi dblp
A PTAS for the Square Tiling Problem
Amihood Amir | Alberto Apostolico | Gad M. Landau | Oren Sar Shalom

doi dblp
On the Hardness of Counting and Sampling Center Strings
Christina Boucher | Mohamed Omar

doi dblp
Counting and Verifying Maximal Palindromes
Tomohiro I | Shunsuke Inenaga | Hideo Bannai | Masayuki Takeda

doi dblp
Identifying SNPs without a Reference Genome by Comparing Raw Reads
Pierre Peterlongo | Nicolas Schnel | Nadia Pisanti | Marie-France Sagot | Vincent Lacroix

doi dblp
Dynamic Z-Fast Tries
Djamal Belazzougui | Paolo Boldi | Sebastiano Vigna

doi dblp
Improved Fast Similarity Search in Dictionaries
Daniel Karch | Dennis Luxen | Peter Sanders

doi dblp
Training Parse Trees for Efficient VF Coding
Takashi Uemura | Satoshi Yoshida | Takuya Kida | Tatsuya Asai | Seishi Okamoto

doi dblp
Algorithms for Finding a Minimum Repetition Representation of a String
Atsuyoshi Nakamura | Tomoya Saito | Ichigaku Takigawa | Hiroshi Mamitsuka | Mineichi Kudo

doi dblp
Faster Compressed Dictionary Matching
Wing-Kai Hon | Tsung-Han Ku | Rahul Shah | Sharma V. Thankachan | Jeffrey Scott Vitter

doi dblp
Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
Shanika Kuruppu | Simon J. Puglisi | Justin Zobel

doi dblp
Standard Deviation as a Query Hardness Estimator
Joaquín Pérez-Iglesias | Lourdes Araujo

doi dblp
Using Related Queries to Improve Web Search Results Ranking
Georges Dupret | Ricardo Zilleruelo-Ramos | Sumio Fujita

doi dblp
Evaluation of Query Performance Prediction Methods by Range
Joaquín Pérez-Iglesias | Lourdes Araujo

doi dblp
Mining Large Query Induced Graphs towards a Hierarchical Query Folksonomy
Alexandre P. Francisco | Ricardo Baeza-Yates | Arlindo L. Oliveira

doi dblp
Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems
Effat Farhana | Jannatul Ferdous | Tanaeem M. Moosa | M. Sohel Rahman

doi dblp
Restricted LCS
Zvi Gotthilf | Danny Hermelin | Gad M. Landau | Moshe Lewenstein

doi dblp
Extracting Powers and Periods in a String from Its Runs Structure
Maxime Crochemore | Costas S. Iliopoulos | Marcin Kubica | Jakub Radoszewski | Wojciech Rytter | Tomasz Walen

doi dblp
On Shortest Common Superstring and Swap Permutations
Zvi Gotthilf | Moshe Lewenstein | Alexandru Popa

doi dblp
A Self-Supervised Approach for Extraction of Attribute-Value Pairs from Wikipedia Articles
Wladmir C. Brandão | Edleno Silva de Moura | Altigran Soares da Silva | Nivio Ziviani

doi dblp
Temporal Analysis of Document Collections: Framework and Applications
Omar Alonso | Michael Gertz | Ricardo Baeza-Yates

doi dblp
Text Comparison Using Soft Cardinality
Sergio Jiménez | Fabio A. González | Alexander F. Gelbukh

doi dblp
Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval
Felipe Bravo-Marquez | Gaston L'Huillier | Sebastián A. Ríos | Juan D. Velásquez

doi dblp
Dual-Sorted Inverted Lists
Gonzalo Navarro | Simon J. Puglisi

doi dblp
CST++
Enno Ohlebusch | Johannes Fischer | Simon Gog

doi dblp
Succinct Representations of Dynamic Strings
Meng He | J. Ian Munro

doi dblp
Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes
Enno Ohlebusch | Simon Gog | Adrian Kügel

doi dblp
The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching
Maxime Crochemore | German Tischler

doi dblp
Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract)
Alberto Apostolico | Péter L. Erdös | Alpár Jüttner

doi dblp
Fast Bit-Parallel Matching for Network and Regular Expressions
Yusaku Kaneta | Shin-ichi Minato | Hiroki Arimura

doi dblp
String Matching with Variable Length Gaps
Philip Bille | Inge Li Gørtz | Hjalte Wedel Vildhøj | David Kofoed Wind

doi dblp
Approximate String Matching with Stuck Address Bits
Amihood Amir | Estrella Eisenberg | Orgad Keller | Avivit Levy | Ely Porat