International Symposium on String Processing and Information Retrieval (2009)
String Processing and Information Retrieval, 16th International Symposium, SPIRE 2009, Saariselkä, Finland, August 25-27, 2009, Proceedings
Range Quantile Queries: Another Virtue of Wavelet Trees
Travis Gagie
|
Simon J. Puglisi
|
Andrew Turpin
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees
Daiji Fukagawa
|
Tatsuya Akutsu
|
Atsuhiro Takasu
k2-Trees for Compact Web Graph Representation
Nieves R. Brisaboa
|
Susana Ladra
|
Gonzalo Navarro
On-Line Construction of Parameterized Suffix Trees
Taehyung Lee
|
Joong Chae Na
|
Kunsoo Park
Succinct Text Indexing with Wildcards
Alan Tam
|
Edward Wu
|
Tak Wah Lam
|
Siu-Ming Yiu
A Compressed Enhanced Suffix Array Supporting Fast String Matching
Enno Ohlebusch
|
Simon Gog
Compressed Suffix Arrays for Massive Data
Jouni Sirén
On Entropy-Compressed Text Indexing in External Memory
Wing-Kai Hon
|
Rahul Shah
|
Sharma V. Thankachan
|
Jeffrey Scott Vitter
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
Daisuke Okanohara
|
Kunihiko Sadakane
Novel and Generalized Sort-Based Transform for Lossless Data Compression
Kazumasa Inagaki
|
Yoshihiro Tomizawa
|
Hidetoshi Yokoo
A Two-Level Structure for Compressing Aligned Bitexts
Joaquín Adiego
|
Nieves R. Brisaboa
|
Miguel A. Martínez-Prieto
|
Felipe Sánchez-Martínez
Directly Addressable Variable-Length Codes
Nieves R. Brisaboa
|
Susana Ladra
|
Gonzalo Navarro
Identifying the Intent of a User Query Using Support Vector Machines
Marcelo Mendoza
|
Juan Zamora
Syntactic Query Models for Restatement Retrieval
Niranjan Balasubramanian
|
James Allan
Use of Co-occurrences for Temporal Expressions Annotation
Olga Craveiro
|
Joaquim Macedo
|
Henrique Madeira
On-Demand Associative Cross-Language Information Retrieval
André Pinto Geraldo
|
Viviane Pereira Moreira
|
Marcos André Gonçalves
A Comparison of Data-Driven Automatic Syllabification Methods
Connie R. Adsett
|
Yannick Marchand
Efficient Index for Retrieving Top-k Most Frequent Documents
Wing-Kai Hon
|
Rahul Shah
|
Shih-Bin Wu
Fast Single-Pass Construction of a Half-Inverted Index
Marjan Celikik
|
Hannah Bast
Two-Dimensional Distributed Inverted Files
Esteban Feuerstein
|
Mauricio Marín
|
Michel J. Mizrahi
|
Veronica Gil-Costa
|
Ricardo Baeza-Yates
Indexing Variable Length Substrings for Exact and Approximate Matching
Gonzalo Navarro
|
Leena Salmela
Expectation of Strings with Mismatches under Markov Chain Distribution
Cinzia Pizzi
|
Mauro Bianco
Consensus Optimizing Both Distance Sum and Radius
Amihood Amir
|
Gad M. Landau
|
Joong Chae Na
|
Heejin Park
|
Kunsoo Park
|
Jeong Seop Sim
Faster Algorithms for Sampling and Counting Biological Sequences
Christina Boucher
Towards a Theory of Patches
Amihood Amir
|
Haim Parienty
The Frequent Items Problem, under Polynomial Decay, in the Streaming Model
Guy Feigenblat
|
Ofra Itzhaki
|
Ely Porat
Improved Approximation Results on the Shortest Common Supersequence Problem
Zvi Gotthilf
|
Moshe Lewenstein
Set Intersection and Sequence Matching
Ariel Shiftan
|
Ely Porat
Generalised Matching
Raphaël Clifford
|
Aram W. Harrow
|
Alexandru Popa
|
Benjamin Sach
Practical Algorithms for the Longest Common Extension Problem
Lucian Ilie
|
Liviu Tinta
A Last-Resort Semantic Cache for Web Queries
Flavio Ferrarotti
|
Mauricio Marín
|
Marcelo Mendoza
A Task-Based Evaluation of an Aggregated Search Interface
Shanu Sushmita
|
Hideo Joho
|
Mounia Lalmas
Efficient Language-Independent Retrieval of Printed Documents without OCR
Walid Magdy
|
Kareem Darwish
|
Motaz Ahmad El-Saban
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
Yoram Bachrach
|
Ralf Herbrich
|
Ely Porat