Time / Day | Monday Oct 29th | Tuesday Oct 30th | Wednesday Oct 31st | Thursday Nov 1st | Friday Nov 2nd |
9:30 - 11:00 |
SPIRE Session on String Processing |
SPIRE Session on Pattern Matching |
SPIRE Session on Compression |
LA-WEB Session on Web Characterization |
LA-WEB Session on Web Applications |
11:00 -11:30 | Coffee Break | Coffee Break | Coffee Break | Coffee Break | Coffee Break |
11:30 - 13:00 | Invited Talk: Near Space-Optimal Perfect Hashing Algorithms Nivio Ziviani, UFMG, Brazil |
Invited Talk:
Measures of Measurements: Robust Evaluation of Search Systems Justin Zobel, NICTA Melbourne, Australia |
SPIRE Session on Web Searching and Modeling |
Invited Talk: Web Workloads: how things have changed and what has remained the same, Virgilio Almeida, UFMG/Brasil |
Tutorial: Online advertising: underlying technologies and business models (Part II) James Shanahan |
13:00 -14:30 | Lunch | Lunch | Lunch | Lunch | Lunch |
14:30 - 16:00 | SPIRE Session on Information Retrieval Applications |
SPIRE Session on Bio Informatics (ends at 16:30) |
Invited Talk: Trends in Online Social Interactions by Andrew Tomkins, Yahoo! Research |
LA-WEB Session on Web Engineering |
LA-WEB Session on Web Semantics |
16:00 - 16:30 | Coffee Break | Coffee Break (16:30) | Coffee Break | Coffee Break | Coffee Break |
16:30 - 19:00 | SPIRE Session on Compression and Text Searching (16:30 to 18:00)   Business Meeting (18:00) |
SPIRE Session on Indexing (starts at 17:00) |
LA-WEB Session on Web Search (ends at 18:00) Business Meeting (18:00) |
LA-WEB Session on Web Economics (ends at 17:30) Tutorial: Online advertising: underlying technologies and business models (Part I) James Shanahan (17:30 - 19:00) |
|
20:00 | SPIRE / LA-WEB Banquet Gambero Restaurant |
Day 1: Monday Oct 29th |
Day 2: Tuesday Oct 30th |
Day 3: Wednesday Oct 31st |
|
9:00 - 9:30 |
Welcome and Opening Ceremony |
||
SESSION on String Processing |
SESSION on Pattern Matching Chair: Alistair Moffat, Univ. of Melbourne, Australia |
SESSION on Compression |
|
9:30 - 10:00 | Christos Makris, Yiannis Panagis, Evangelos Theodoridis and Athanasios Tsakalidis / A Web-Page Usage Prediction Scheme using Weighted Suffix Trees |
Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy and Ely Porat / Efficient Computations of l1 and l∞ Rearrangement Distances |
Joaquín Adiego, Miguel A. Martínez-Prieto and Pablo de la Fuente / Edge-Guided Natural Language Text Compression |
10:00 - 10:30 | Yair Dombb, Ohad Lipsky, Benny Porat,Ely Porat and Asaf Zur / Approximate Swap and Mismatch Edit Distance |
Zvi Gotthilf and Moshe Lewenstein / Approximating Constrained LCS |
J. Shane Culpepper and Alistair Moffat / Compact set representation for information retrieval |
10:30 - 11:00 | Raphaël Clifford and Ely Porat / A filtering algorithm for k-mismatch with don't cares |
Ayelet Butman, Noa Lewenstein, Ely Porat and Benny Porat / Jump-Matching With Errors |
Francisco Claude and Gonzalo Navarro / A Fast and Compact Web Graph Representation |
11:00 - 11:30 | Coffee Break | Coffee Break | Coffee Break |
SESSION on Web Searching and Modeling Chair: Veli Makinen, Univ. of Helsinki, Finland |
|||
11:30 - 12:00 | Invited Speaker: Nivio Ziviani, UFMG, Brazil / Near Space-Optimal Perfect Hashing Algorithms Session Chair: Ricardo Baeza-Yates |
Invited Speaker: Justin Zobel, NICTA Melbourne, Australia / Measures of Measurements: Robust Evaluation of Search Systems Session Chair: Nivio Ziviani |
Ricardo Baeza-Yates, Flavio Junqueira, Vassilis Plachouras and Hans Friedrich Witschel / Admission Policies for Caches of Search Engine Results |
12:00 - 12:30 | Guilherme T. de Assis, Alberto H.F. Laender, Marcos A. Gonçalves, Altigran S. da Silva / Exploiting Genre in Focused Crawling |
||
12:30 - 1:00 | Klaus Berberich, Srikanta Bedathur and Gerhard Weikum / A Pocket Guide to Web History |
||
1:00 - 2:30 | Lunch recess | Lunch recess | Lunch recess |
SESSION on Information Retrieval Applications, Chair: Justin Zobel, NICTA Melbourne, Australia |
SESSION on Bio Informatics Chair: Gonzalo Navarro, Univ. of Chile, Chile |
||
2:30 - 3:00 | Olivier Motelet, Benjamin Piwowarski, Georges Dupret, Jose A. Pino and Nelson Baloian Enhancing Educational-Material Retrieval using Authored-Lesson Metadata |
Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom and Dekel Tsur / Generalized LCS |
|
3:00 - 3:30 | Allali Julien, Pascal Ferraro, Pierre Hanna and Costas Iliopoulos / Local Transpositions in Alignment of Polyphonic Musical Sequences |
Mohamed Ibrahim Abouelhoda / A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences |
Invited Speaker: Andrew Tomkins, Yahoo! Research, USA / Trends in Online Social Interactions Session Chair: Ricardo Baeza-Yates |
3:30 - 4:00 | Carlos Castillo, Debora Donato and Aristides Gionis / Estimating the Number of Citations of a Paper Using Author Reputation |
Leena Salmela and Jorma Tarhio / Algorithms for Weighted Matching |
|
4:00 - 4:30 | Coffee Break | Petri Kalsi, Leena Salmela and Jorma Tarhio / Tuning Approximate Boyer-Moore for Gene Sequences |
|
SESSION on Compression and Text Searching, Chair: Benjamin Piwowarski, Univ. of Chile, Chile |
|||
4:30 - 5:00 | Veli Mäkinen and Gonzalo Navarro / Implicit Compression Boosting with Applications to Self-Indexing |
Coffee Break | |
SESSION on Indexing Chair: Amihood Amir, Bar-Ilan Univ., Israel |
|||
5:00 - 5:30 | Luís M.S. Russo, Gonzalo Navarro and Arlindo L. Oliveira / Approximate String Matching with Lempel-Ziv Compressed Indexes |
Gad M. Landau, Dekel Tsur and Oren Weimann / Indexing a Dictionary for Subset Matching Queries |
|
5:30 - 6:00 | David E. Losada and Ronald T. Fernández / Highly frequent terms and sentence retrieval |
Tetsuo Shibuya / Prefix-Shuffled Geometric Suffix Tree |
|
6:00 - 6:30 | Business Meeting | Ralf Schenkel, Andreas Broschart, Seungwon Hwang, Martin Theobald and Gerhard Weikum / Efficient Text Proximity Search |
|
6:30 - 7:00 | Pang Ko and Srinivas Aluru / Optimal Self-Adjusting Tree for Dynamic String Data in Secondary Storage |
||
8:00 PM approx | SPIRE / LA-WEB Banquet, Gambero Restaurant Extra banquet tickets will be available until Friday 26th at US$40 |
The following list announced the papers that have been accepted by the committee, organized by submission code:
1. Implicit Compression Boosting with Applications to Self-Indexing
Veli Makinen, University of Helsinki, Finland
Gonzalo Navarro, University of Chile, Chile
2. Prefix-Shuffled Geometric Suffix Tree
Tetsuo Shibuya, University of Tokyo, Japan
3. A Web-Page Usage Prediction Scheme using Weighted Suffix Trees
Christos Makris, Computer Engineering and Informatics Department,University
of Patras, Greece
Yiannis Panagis, Computer Engineering and Informatics Department,University
of Patras, Greece
Evangelos Theodoridis, Computer Engineering and Informatics Department,University
of Patras, Greece
Athanasios Tsakalidis, Computer Engineering and Informatics Department,University
of Patras, Greece
9. Edge-Guided Natural Language Text Compression
Joaquin Adiego, Universidad de Valladolid, Spain
Miguel Angel Martinez-Prieto, Universidad de Valladolid, Spain
Pablo de la Fuente, Universidad de Valladolid, Spain
12. Indexing a Dictionary for Subset Matching Queries
Gad M. Landau, University of Haifa, Israel
Dekel Tsur, Ben-Gurion University, Israel
Oren Weimann, MIT, USA
16. Efficient Computations of L1 and Linfinity Rearrangement Distances
Amihood Amir, Bar-Ilan University, Israel
Yonatan Aumann, Bar-Ilan University, Israel
Piotr Indyk, MIT, USA
Avivit Levy, Bar-Ilan University, Israel
Ely Porat, Bar-Ilan University, Israel
18. Highly frequent terms and sentence retrieval
David Losada, University of Santiago de Compostela, Spain
Ronald T. Fernandez, University of Santiago de Compostela, Spain
21. Enhancing Educational-Material Retrieval using Authored-Lesson
Metadata
Olivier Motelet, Universidad de Chile, Chile
Benjamin Piwowarski, Yahoo! Research, Chile
Georges Dupret, Yahoo! Research, Chile
Jose A. Pino, Universidad de Chile, Chile
Nelson Baloian, Universidad de Chile, Chile
22. Local Transpositions in Alignment of Polyphonic Musical Sequences
Allali Julien, University Bordeaux, France
Ferraro Pascal, University Bordeaux, France
Hanna Pierre, University Bordeaux, France
Iliopoulos Costas, King's College London, UK
23. Approximate String Matching with Lempel-Ziv Compressed Indexes
Luis Manuel Silveira Russo, INESC-ID / IST, Portugal
Gonzalo Navarro, University of Chile, Chile
Arlindo Oliveira, INESC-ID / IST, Portugal
25. A Pocket Guide to Web History
Klaus Berberich, Max-Planck Institute for Computer Science, Germany
Srikanta Bedathur, Max-Planck Institute for Computer Science, Germany
Gerhard Weikum, Max-Planck Institute for Computer Science, Germany
26. Compact set representation for information retrieval
J Shane Culpepper, University of Melbourne, Australia
Alistair Moffat, University of Melbourne, Australia
28. Generalized LCS
Amihood Amir, Bar Ilan University and Georgia Tech, Israel
Tzvika Hartman, Bar Ilan University, Israel
Oren Kapah, Bar Ilan University and CRI Haifa, Israel
B. Riva Shalom, Bar Ilan University, Israel
Dekel Tsur, Ben Gurion University, Israel
37. Estimating the Number of Citations of a Paper Using Author
Reputation
Carlos Castillo,
Yahoo! Research Barcelona, Spain
Debora Donato,
Yahoo! Research Barcelona, Spain
Aristides Gionis,
Yahoo! Research Barcelona, Spain
39. Approximate Swap and Mismatch Edit Distance
Ely Porat, Bar-Ilan University, Israel
Yair Dombb, Bar-Ilan University, Israel
Ohad Lipsky, Bar-Ilan University, Israel
Benny Porat, Bar-Ilan University, Israel
Asaf Zur, Bar-Ilan University, Israel
40. A Chaining Algorithm for Mapping cDNA Sequences to Multiple
Genomic Sequences
Mohamed Ibrahim Abouelhoda, University of Ulm, Germany
41. Algorithms for Weighted Matching
Leena Salmela, Helsinki University of Technology, Finland
Jorma Tarhio, Helsinki University of Technology, Finland
44. Tuning Approximate Boyer-Moore for Gene Sequences
Petri Kalsi, Helsinki University of Technology Finland
Leena Salmela, Helsinki University of Technology, Finland
Jorma Tarhio, Helsinki University of Technology, Finland
49. Admission Policies for Caches of Search Engine Results
Ricardo Baeza-Yates, Yahoo! Research Barcelona, Spain
Flavio Paiva Junqueira, Yahoo! Research Barcelona, Spain
Vassilis Plachouras, Yahoo! Research Barcelona, Spain
Hans Friedrich Witschel, University of Leipzig, Germany
51. A filtering algorithm for k-mismatch with don't cares
Raphael Clifford, Bristol University, United Kingdom
Ely Porat, Bar-Ilan University, Israel
55. Exploiting Genre in Focused Crawling
Guilherme Assis, Federal University of Minas Gerais, Brazil
Alberto Laender, Federal University of Minas Gerais, Brazil
Marcos Gonçalves, Federal University of Minas Gerais, Brazil
Altigran Silva, Federal University of Amazonas, Brazil
56. Efficient Text Proximity Search
Ralf Schenkel, Max-Planck-Institut Informatik, Germany
Andreas Broschart, Max-Planck-Institut Informatik. Germany
Seungwon Hwang, POSTECH, Korea
Gerhard Weikum, Max-Planck-Institut Informatik, Germany
58. A Fast and Compact Web Graph Representation
Francisco Claude, Universidad de Chile, Chile
Gonzalo Navarro, Universidad de Chile, Chile
59. Optimal Self-Adjusting Tree for Dynamic String Data in Secondary
Storage
Pang Ko, Iowa State University, USA
Srinivas Aluru, Iowa State University, USA
73. Approximating Constrained LCS
Zvi Gotthilf, Bar Ilan University, Israel
Moshe Lewenstein, Bar Ilan University, Israel
75. Jump-Matching With Errors
Ayelet Butman, Holon Academic Institute of Technology, Israel
Noa Lewenstein, Netanya Academic College, Israel
Ely Porat, Bar Ilan University, Israel
Benny Porat, Bar Ilan University, Israel
77. Extending weighting models with a term quality measure
Christina Lioma, University of Glasgow, UK
Iadh Ounis, University of Glasgow, UK