SPIRE 2015 – Programme

Tuesday, 1 September 2015

09:00-09:20

Registration

09:20-09:30

Opening and Welcome from Organizers

Keynote talk, Chair: Ricardo Baeza-Yates

09:30-10:25

Aris Gionis

Computational Problems in Mining Urban Data

10:25-10:45

Coffee Break

Session on Data Mining, Chair: Simon Puglisi

10:45-11:10

Massimo Melucci

Efficient Term Set Prediction Using the Bell-Wigner Inequality

11:10-11:35

Djamal Belazzougui and Fabio Cunial

Space-efficient Detection of Unusual Words

11:35-12:00

Jonathan Dimond and Peter Sanders

Faster Exact Searching using Document Clustering

12:00-14:15

Lunch Break

            Session on Computational Biology, Chair: Solon Pissis

14:15-14:40

Michal Hozza, Tomáš Vinař and Broňa Brejová

How Big is That Genome? Estimating Genome Size and Coverage from k-mer Abundance Spectra

14:40-15:05

Vladimír Boža, Jakub Jursa, Broňa Brejová and Tomáš Vinař

Fishing in Read Collections: Memory Efficient Indexing for Sequence Assembly

15:05-15:30

Guillaume Fertin, Loïc Jankowiak and Geraldine Jean

Prefix and Suffix Reversals on Strings

15:30-15:55

Julien Allali, Cedric Chauve and Laetitia Bourgeade

Chaining Fragments in Sequences: To sweep or Not

15:55-16:15

Coffee Break

Session on Information Retrieval (1), Chair: Emine Yilmaz

16:15-16:40

Dhruv Gupta and Klaus Berberich

Temporal Query Classification at Different Granularities

16:40-17:05

Olga Craveiro, Joaquim Macedo and Henrique Madeira

Temporal Analysis of the CHAVE Collection

17:05-17:30

Radu Ionescu, Adrian-Gabriel Chifu and Josiane Mothe

DeShaTo: Describing the Shape of Cumulative Topic Distributions to Rank Retrieval Systems without Relevance Judgments

17:30-17:55

Kai Hui and Klaus Berberich

Selective Labelling and Incomplete Label Mitigation for Low Cost Evaluation


Wednesday, 2 September 2015

 

Keynote talk, Chair: Emine Yilmaz

09:05-10:00

Mounia Lalmas

A Journey into Evaluation: from Retrieval Effectiveness to User Engagement

10:00-10:45

Coffee Break

Session on Information Retrieval (2), Chair: Mounia Lalmas

10:45-11:10

Ricardo Baeza-Yates, Marti Mayo-Casademont and Luz Rello

Feasibility of Word Difficulty Prediction

11:10-11:35

Daniel Ferrés and Horacio Rodríguez

Evaluating Geographical Knowledge: Re-Ranking, Linguistic Processing and Query Expansion techniques for Geographical Information Retrieval

11:35-12:00

Wadson Gomes Ferreira, William Antônio Dos Santos, Breno Macena Pereira de Souza, Tiago Matta Machado Zaidan and Wladmir Cardoso Brandão

Assessing the Efficiency of Suffix Stripping Approaches for Portuguese Stemming

12:00-14:15

Lunch Break

Session on Compact Data Structures, Chair: Simon Gog

14:15-14:40

Andreas Poyias and Rajeev Raman

Improved Practical Compact Dynamic Tries

14:40-15:05

Christina Boucher, Alexander Bowe, Travis Gagie, Giovanni Manzini and Jouni Sirén

Relative Select

15:05-15:30

Uwe Baier, Timo Beller and Enno Ohlebusch

Parallel Construction of Succinct Suffix Tree Topologies

Special session, Chair: Maxime Crochemore

15:30-15:45

In memory of Alberto Apostolico

15:45-16:10

Coffee Break

Session on Stringology (1), Chair: Hideo Bannai

16:10-16:35

Johannes Fischer, Štěpán Holub, Tomohiro I, Moshe Lewenstein

Beyond the Runs Theorem

16:35-17:00

Paweł Gawrychowski, Gregory Kucherov, Benjamin Sach and Tatiana Starikovskaya

Computing the Longest Unbordered Substring

17:00-17:25

Jérémy Barbay and Pablo Pérez-Lantero

Adaptive Computation of the Swap-Insert Correction Distance

17:25-17:50

Sebastian Maneth Alberto Ordóñez and Helmut Seidl

Transforming XML Streams with References


Thursday, 3 September 2015

 

Keynote talk, Chair: Simon Puglisi

09:05-10:00

Rajeev Raman

Encodings = (Data Structures) - (Data)

10:00-10:20

Coffee Break

Session on Indexing, Chair: Giovanni Manzini

10:20-10:45

Nieves R. Brisaboa, Ana Cerdeira-Pena, Antonio Fariña and Gonzalo Navarro

A Compact RDF Store Using Suffix Arrays

10:45-11:10

Szymon Grabowski and Marcin Raniszewski

Sampling the Suffix Array with Minimizers

11:10-11:35

Tamanna Chhabra, Emanuele Giaquinta and Jorma Tarhio

Filtration Algorithms for Approximate Order-Preserving Matching

11:35-12:00

Amihood Amir, Moshe Lewenstein and Sharma V. Thankachan

Range LCP Queries Revisited

12:00-14:15

Lunch Break

Session on Index Construction, Chair: Shunsuke Inenaga

14:15-14:40

Wei Jun Liu, Ge Nong, Wai Hong Chan and Yi Wu

Induced Sorting Suffixes in External Memory with Better Design and Less Space

14:40-15:05

Yoshimasa Takabatake, Yasuo Tabei and Hiroshi Sakamoto

Online Self-Indexed Grammar Compression

15:05-15:30

Alberto Policriti and Nicola Prezza

Fast Online Lempel-Ziv Factorization in Compressed Space

Special session

15:30-15:50

Business meeting

15:50-16:10

Coffee Break

Session on Stringology (2), Chair: Golnaz Badkobeh

16:10-16:35

Marius Dumitran, Florin Manea and Dirk Nowotka

On Prefix/Suffix-Square Free Words

16:35-17:00

Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter and Tomasz Waleń

Tight Bound for the Number of Distinct Palindromes in a Tree

17:00-17:25

Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto and Tomasz Waleń

Efficient Algorithms for the Longest Closed Factor Array

17:25-17:50

Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda

A faster algorithm for computing maximal α-gapped repeats in a string