default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16. SPIRE 2009: Saariselkä, Finland
- Jussi Karlgren
, Jorma Tarhio, Heikki Hyyrö:
String Processing and Information Retrieval, 16th International Symposium, SPIRE 2009, Saariselkä, Finland, August 25-27, 2009, Proceedings. Lecture Notes in Computer Science 5721, Springer 2009, ISBN 978-3-642-03783-2
Algorithms on Trees
- Travis Gagie, Simon J. Puglisi, Andrew Turpin:
Range Quantile Queries: Another Virtue of Wavelet Trees. 1-6 - Daiji Fukagawa, Tatsuya Akutsu, Atsuhiro Takasu:
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees. 7-17 - Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro:
k2-Trees for Compact Web Graph Representation. 18-30 - Taehyung Lee, Joong Chae Na, Kunsoo Park:
On-Line Construction of Parameterized Suffix Trees. 31-38
Compressed Indexes
- Alan Tam, Edward Wu, Tak Wah Lam, Siu-Ming Yiu:
Succinct Text Indexing with Wildcards. 39-50 - Enno Ohlebusch, Simon Gog:
A Compressed Enhanced Suffix Array Supporting Fast String Matching. 51-62 - Jouni Sirén:
Compressed Suffix Arrays for Massive Data. 63-74 - Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter:
On Entropy-Compressed Text Indexing in External Memory. 75-89
Compression
- Daisuke Okanohara, Kunihiko Sadakane:
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting. 90-101 - Kazumasa Inagaki, Yoshihiro Tomizawa, Hidetoshi Yokoo:
Novel and Generalized Sort-Based Transform for Lossless Data Compression. 102-113 - Joaquín Adiego, Nieves R. Brisaboa, Miguel A. Martínez-Prieto, Felipe Sánchez-Martínez:
A Two-Level Structure for Compressing Aligned Bitexts. 114-121 - Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro:
Directly Addressable Variable-Length Codes. 122-130
Content Analysis
- Marcelo Mendoza, Juan Zamora:
Identifying the Intent of a User Query Using Support Vector Machines. 131-142 - Niranjan Balasubramanian, James Allan:
Syntactic Query Models for Restatement Retrieval. 143-155 - Olga Craveiro, Joaquim Macedo, Henrique Madeira:
Use of Co-occurrences for Temporal Expressions Annotation. 156-164 - André Pinto Geraldo, Viviane Pereira Moreira, Marcos André Gonçalves:
On-Demand Associative Cross-Language Information Retrieval. 165-173 - Connie R. Adsett, Yannick Marchand:
A Comparison of Data-Driven Automatic Syllabification Methods. 174-181
Indexing
- Wing-Kai Hon, Rahul Shah, Shih-Bin Wu:
Efficient Index for Retrieving Top-k Most Frequent Documents. 182-193 - Marjan Celikik, Hannah Bast:
Fast Single-Pass Construction of a Half-Inverted Index. 194-205 - Esteban Feuerstein, Mauricio Marín, Michel J. Mizrahi, Veronica Gil-Costa, Ricardo Baeza-Yates:
Two-Dimensional Distributed Inverted Files. 206-213 - Gonzalo Navarro, Leena Salmela:
Indexing Variable Length Substrings for Exact and Approximate Matching. 214-221
String Algorithms and Bioinformatics
- Cinzia Pizzi, Mauro Bianco:
Expectation of Strings with Mismatches under Markov Chain Distribution. 222-233 - Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim:
Consensus Optimizing Both Distance Sum and Radius. 234-242 - Christina Boucher:
Faster Algorithms for Sampling and Counting Biological Sequences. 243-253
String Algorithms and Theory I
- Amihood Amir, Haim Parienty:
Towards a Theory of Patches. 254-265 - Guy Feigenblat, Ofra Itzhaki, Ely Porat:
The Frequent Items Problem, under Polynomial Decay, in the Streaming Model. 266-276 - Zvi Gotthilf, Moshe Lewenstein:
Improved Approximation Results on the Shortest Common Supersequence Problem. 277-284
String Algorithms and Theory II
- Ariel Shiftan, Ely Porat:
Set Intersection and Sequence Matching. 285-294 - Raphaël Clifford, Aram W. Harrow, Alexandru Popa, Benjamin Sach:
Generalised Matching. 295-301 - Lucian Ilie, Liviu Tinta:
Practical Algorithms for the Longest Common Extension Problem. 302-309
Using and Understanding Usage
- Flavio Ferrarotti, Mauricio Marín, Marcelo Mendoza:
A Last-Resort Semantic Cache for Web Queries. 310-321 - Shanu Sushmita, Hideo Joho, Mounia Lalmas:
A Task-Based Evaluation of an Aggregated Search Interface. 322-333 - Walid Magdy, Kareem Darwish, Motaz Ahmad El-Saban:
Efficient Language-Independent Retrieval of Printed Documents without OCR. 334-343 - Yoram Bachrach, Ralf Herbrich, Ely Porat:
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems. 344-352
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-09-02 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
