Home SISAP
Home SISAP 2008
Call for Papers
Important Dates
Program Committee
Conference Venue
Organization
Invited Speakers
Accepted Papers
Conference Program
Online presentations
Conference Picture
METRIC SPACES LIBRARY
Links

Conference Program

Friday 11th


13:30-13:40 Welcome


13:40-14:30 Invited Talk

Evolving Models of Biological Sequence Similarity

Daniel Miranker


14:30-14:45 break


14:45-16:00 Session 1: Searching in Specific Metric Spaces


HiPeR : Hierarchical Progressive Exact Retrieval in Multi-dimensional Spaces

Nouha Bouteldja, Valerie Gouet-Brunet and Michel Scholl


High-Dimensional Similarity Retrieval Using Dimensional Choice

Dave Tahmoush and Hanan Samet


Approximate Similarity Search in Sequence Databases using Landmark-Guided Embedding

Ahmet Sacan and Ismail Toroslu


16:00-16:15 break


16:15-17:30 Session 2: Spaces and Similarities


Visual Similarity in Sign Language

Jan Ulrych and Michal Kopecky


A Contextual Normalised Edit Distance

Colin de la Higuera and Luisa Mico


Counting Distance Permutations

Matthew Skala



Saturday 12th


9:40-10:30 Invited Talk

The Many Facets of Approximate Similarity Search

Marco Patella


10:30-10:45 break


10:45-12:00 Session 3: Distributed Indexes


Combining Metric Features in Large Collections

Michal Batko, Petra Kohoutkova and Pavel Zezula


Similarity Searching: Towards Bulk-loading Peer-to-Peer Networks

Vlastislav Dohnal, Jan Sedmidubsky, Pavel Zezula and David Novák


An Empirical Evaluation of a Distributed Clustering-based Index for Metric Space Databases

Veronica Gil-Costa, Mauricio Marin and Nora Reyes


12:00-13:30 lunch


13:30-14:45 Session 4: Index (Re)Organization


A Dynamic Pivot Selection Technique for Similarity Search

Benjamin Bustos, Oscar Pedreira and Nieves R. Brisaboa


Effective Use of Space for Pivot-Based Metric Indexing Structures

Cengiz Celik


On Reinsertions in M-tree

Jakub Loko. and Tomas Skopal


14:45-15:00 break


15:00-16:15 Session 5: Advanced Similarity Problems


List of Twin Clusters: a Data Structure for Similarity Joins in Metric Spaces

Rodrigo Paredes and Nora Reyes


Anytime K-Nearest Neighbor Search for Database Applications

Weijia Xu, Daniel Miranker and Rui Mao


On the Complexity of Reverse Similarity Search

Matthew Skala


16:15-16:30 break


16:30-17:30 Panel discussion and farewell

Home - Call for Papers - Paper Submission - Registration - Invited Speakers - Tourist Information - Accomodation - Links - Contact