Jul 17, 2013 Comments Off on Schedule
Schedule
Arrival Day ? Sep 26
15:00 – 19:00 Check-in
19:00 ‐21:30??Welcome Reception
Day 1 ? Sep 27
7:30 ‐9:00??Breakfast
9:00 ‐10:30??Session 1
| Ian Munro | Succinct data structures for representing equivalence classes |
| Rajeev Raman | Encodings for top-k and range selection |
| Moshe Lewenstein | Two Dimensional Range Minimum Queries and Fibonacci Lattices |
11:00 ‐12:00??Session 2
| Sebastiano Vigna | Quasi-Succinct Indices |
| Simon Gog | Integer Alphabet-based Self-Indexes at Terabyte Scale |
12:00 – 14:00 Lunch
14:00 – 15:40 Session 3
| Travis Gagie | An Alignment-Based Index for Genomic Datasets |
| Martin Frith | Bio-sequence similarity search with spaced suffix arrays and subset suffix arrays |
| Alexander Bowe | Succinct de Bruijn Graphs |
| Taku Onodera | Detecting Superbubbles in Assembly Graphs |
16:00 – 18:00 Session 4 ? ? Discussions
18:00 – 19:30 Dinner
Day 2 ? Sep 28
7:30 ‐9:00??Breakfast
9:00 ‐11:00??Session 5
| Srinivasa Rao Satti | Selection from Read-Only Memory with Limited Workspace |
| Venkatesh Raman | Improved Selection Algorithms for Integers in Read-only Memory and Restore Models |
| Ankur Gupta | Online Multiselection |
| Gonzalo Navarro | Document Retrieval on General Sequences |
11:30 ‐12:30??Session 6
| Francisco Claude | Adaptive Data Structures for Permutations and Binary Relations |
| Giuseppe Ottaviano | Compressed tries and top-k string completion |
12:30 – 14:00 Lunch
14:00 -?16:20 Session 7
| Anish Shrestha | New Challenges to Processing DNA Data from Modern-day Sequencers |
| Yasuo Tabei | Succinct data structures for scalable similarity search in ChemBioinformatics |
| Tetsuo Shibuya | Fast Indexing Method for Protein 3-D Structure Searching |
| Jesper Larsson | Encoding and modeling for set compression |
| Takuya Akiba | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned?Landmark Labeling |
16:20 – 18:00 Session 8 ? ? ? Discussions
18:00 – 19:30 Dinner
Day 3 ? Sep 29
7:30 ‐9:00??Breakfast
9:00 ‐11:00??Session 9
| Hiroshi Sakamoto | An application of stream compression |
| Shirou Maruyama | Fully-Online Grammar Compression |
| Hiroki Arimura | Faster Broad-Word Pattern Matching Algorithms for?Regular Expressions and Trees |
| Takuya Kida | Data Compression using Variable-to-Fixed Length Codes |
11:00 – 11:30 Group Photo Shooting
11:30 ‐12:30 ?Session 10
| Shin-ichi Minato | ZDD-Based Representation for Large-Scale Sparse Datasets?and Z-Skip-Links for Fast Traversal |
12:30 – 13:30 Lunch
13:30 -?19:00 Excursion to Kamakura
19:00 – 21:30 Banquet
Day 4 ? Sep 30
7:30 ‐9:00??Breakfast
( ? ? ? ? ?- 10:00 ?Check-out)
9:00 ‐10:30??Session 11
| Shuhei Denzumi | DenseZDD: A Fast and Compact Data Structure for Family of Sets &PathSeqBDD:?A DAG Index based on Sequence BDD |
| Koji Tsuda | Enumeration Algorithms and Statistical Significance |
| Takeaki Uno | Similarity based Approach for Compression of Noisy Data |
10:30 ‐12:00??Session 12 ? ? Disucssions
12:00 – 13:30 Lunch
13:30 ? ? ? ? ? ? ? Dismiss
