Access the Proceedings On-line
Wednesday, Nov 2
| 11:00 - 11:10 | SPIRE 2005 Opening |
| 11:10 - 12:10 |
Invited Talk: Prabhakar Raghavan "Incentive Networks" |
| 12:10 - 12:20 | LA-WEB 2005 Closing |
| 12:20 - 13:20 | Lunch |
| 13:20 - 14:30 | Session 1: Inverted Indexes |
| 14:30 - 14:45 | Coffee break |
| 14:45 - 16:10 | Session 2: Web and XML Retrieval |
| 16:10 - 16:25 | Coffee break |
| 16:25 - 18:05 | Session 3: Data Structures |
| 18:15 - 20:45 | Mini-tutorial: Mining the Web (R. Baeza-Yates) |
| 21:30 - | SPIRE/LAWEB Conference Banquet |
Thursday, Nov 3
| 9:00 - 10:00 |
Invited Talk: Paolo Ferragina "Compressing and Indexing Strings and Trees" (download) |
| 10:00 - 10:15 | Coffee break |
| 10:15 - 11:30 | Session 4: Similarity |
| 11:30 - 11:45 | Coffee break |
| 11:45 - 13:10 | Session 5: Text Analysis |
| 13:10 - 14:10 | Lunch |
| 14:10 - 15:45 | Session 6: Alignments and Repetitions |
| 15:45 - 16:00 | Coffee break |
| 16:00 - 17:25 | Session 7: Language, Evaluation, and Multimedia |
| 17:25 - 17:40 | Coffee break |
| 17:40 - 19:15 | Session 8: Approximate Matching I |
Friday, Nov 4
| 9:00 - 10:00 |
Invited Talk: Gonzalo Navarro "When Music Meets Geometry: On Algorithmic Aspects of Music Retrieval" |
| 10:00 - 10:15 | Coffee break |
| 10:15 - 11:25 | Session 9: Modeling |
| 11:25 - 11:40 | Coffee break |
| 11:40 - 13:10 | Session 10: Approximate Matching II |
| 13:10 - 14:10 | Lunch |
| 14:10 - 15:45 | Session 11: Structural Similarity |
| 15:45 - 16:00 | Coffee break |
| 16:00 - 17:10 | Session 12: String and Tree Matching |
| 17:10 - 17:20 | SPIRE 2005 Closing |
| 20:00? - | Some event by night |
Session 1: Inverted Indexes
| 13:20 - 13:45 | Enhanced Byte Codes with Restricted Prefix Properties J. Shane Culpepper, Alistair Moffat |
| 13:45 - 14:10 | Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences Ricardo Baeza-Yates, Alejandro Salinger |
| 14:10 - 14:30 | Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups Paolo Boldi, Sebastiano Vigna |
Session 2: Web and XML Retrieval
| 14:45 - 15:10 | XML Retrieval with a Natural Language Interface Xavier Tannier, Shlomo Geva |
| 15:10 - 15:30 | Recommending Better Queries from Click-Through Data Georges Dupret, Marcelo Mendoza |
| 15:30 - 15:50 | A Bilingual Linking Service for the Web Alessandra Alaniz Macedo, José Antonio Camacho-Guerrero, Maria da Graça Campos Pimentel |
| 15:50 - 16:10 | Evaluating Hierarchical Clustering of Search Results Juan M. Cigarran, Anselmo Peñas, Julio Gonzalo, Felisa Verdejo |
Session 3: Data Structures
| 16:25 - 16:50 | Counting Suffix Arrays and Strings Klaus-Bernd Schürmann, Jens Stoye |
| 16:50 - 17:15 | Towards Real-Time Suffix Tree Construction Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein |
| 17:15 - 17:40 | Rank-Sensitive Data Structures Iwona Bialynicka-Birula, Roberto Grossi |
| 17:40 - 18:05 | Cache-conscious Collision Resolution in String Hash Tables Nikolas Askitis, Justin Zobel |
Session 4: Similarity
| 10:15 - 10:40 | Measuring the Difficulty of Distance-Based Indexing Matthew Skala |
| 10:40 - 11:05 | N-gram Similarity and Distance Grzegorz Kondrak |
| 11:05 - 11:30 | Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces Rodrigo Paredes, Edgar Chávez |
Session 5: Text Analysis
| 11:45 - 12:10 | Classifying Sentences using Induced Structure Menno van Zaanen, Luiz Augusto Pizzato, Diego Mollá |
| 12:10 - 12:30 | Counting Lumps in Word Space: Density as a Measure of Corpus Homogeneity Magnus Sahlgren, Jussi Karlgren |
| 12:30 - 12:50 | Multi-label Text Categorization Using K-Nearest Neighbor Approach with M-Similarity Yi Feng, Zhaohui Wu, Zhongmei Zhou |
| 12:50 - 13:10 | Lydia: A System for Large-Scale News Analysis Levon Lloyd, Dimitrios Kechagias, Steven Skiena |
Session 6: Alignments and Repetitions
| 14:10 - 14:35 | Composite Pattern Discovery for PCR Application Stanislav Angelov, Shunsuke Inenaga |
| 14:35 - 15:00 | Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-Factor Array Pierre Peterlongo, Nadia Pisanti, Frederic Boyer, Marie-France Sagot |
| 15:00 - 15:25 | Linear Time Algorithm for the Generalised Longest Common Repeat Problem Inbok Lee, Yoan José Pinzón Ardila |
| 15:25 - 15:45 | Application of Clustering Technique in Multiple Sequence Alignment Patrícia Silva Peres, Edleno Silva de Moura |
Session 7: Language, Evaluation, and Multimedia
| 16:00 - 16:25 | Stemming Arabic Conjunctions and Prepositions Abdusalam F.A. Nwesri, S.M.M. Tahaghoghi, Falk Scholer |
| 16:25 - 16:45 | XML Multimedia Retrieval Zhigang Kong, Mounia Lalmas |
| 16:45 - 17:05 | Retrieval Status Values in Information Retrieval Evaluation Amélie Imafouo, Xavier Tannier |
| 17:05 - 17:25 | A Generalization of the Method for Evaluation of Stemming Algorithms Based on Error Counting Ricardo Sánchez de Madariaga, José Raúl Fernández del Castillo, José Ramón Hilera |
Session 8: Approximate Matching I
| 17:40 - 18:05 | Necklace Swap Problem for Rhythmic Similarity Measures Yoan José Pinzón Ardila, Raphaël Clifford, Manal Mohamed |
| 18:05 - 18:30 | Faster Generation of Super Condensed Neighbourhoods using Finite Automata Luís M.S. Russo, Arlindo L. Oliveira |
| 18:30 - 18:55 | Restricted Transposition Invariant Approximate String Matching Under Edit Distance Heikki Hyyrö |
| 18:55 - 19:15 | Fast Plagiarism Detection System Maxim Mozgovoy, Kimmo Fredriksson, Daniel White, Mike Joy, Erkki Sutinen |
Session 9: Modeling
| 10:15 - 10:40 | A Model for Information Retrieval based on Possibilistic Networks Asma H. Brini, Mohand Boughanem, Didier Dubois |
| 10:40 - 11:05 | Comparison of Representations of Multiple Evidence using a Functional Framework for IR Ilmério R. Silva, João N. Souza, Luciene C. Oliveira |
| 11:05 - 11:25 | Deriving TF-IDF as a Fisher kernel Charles Elkan |
Session 10: Approximate Matching II
| 11:40 - 12:05 | Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem Lasse Bergroth |
| 12:05 - 12:30 | Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park |
| 12:30 - 12:50 | L_1 Pattern Matching Lower Bound Ohad Lipsky, Ely Porat |
| 12:50 - 13:10 | Approximate Matching in the L_infty Metric Ohad Lipsky, Ely Porat |
Session 11: Structural Similarity
| 14:10 - 14:35 | An Edit Distance between RNA Stem-loops Valentin Guignon, Cedric Chauve, Sylvie Hamel |
| 14:35 - 15:00 | A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison Julien Allali, Marie-France Sagot |
| 15:00 - 15:25 | Normalized Similarity of RNA Sequences Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann |
| 15:25 - 15:45 | A Fast Algorithmic Technique for Comparing Large Phylogenetic Trees Gabriel Valiente |
Session 12: String and Tree Matching
| 16:00 - 16:25 | Practical and Optimal String Matching Kimmo Fredriksson, Szymon Grabowski |
| 16:25 - 16:50 | A Bit-parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's Hisashi Tsuji, Akira Ishino, Masayuki Takeda |
| 16:50 - 17:10 | A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching Liu Ping, Liu Yan-bing, Tan Jian-long |
(Time for presentations: 20 min (+5 for questions) full papers, 15 min (+5 for questions) short papers).