Tutorial Accepted on SBBD 2009

My tutorial Similarity Search and Indexing for High-Dimensional Data has been accepted on SBBD 2009 (The Brazilian Symposium on Databases).  Here’s the abstract:

Searching by similarity is a critical operation on many systems, and thus has attracted the attention of many disciplines in Computer Sciences, including Computational Geometry, Machine Learning, Multimedia and, of course, Databases. To perform efficiently, similarity search requires the support of indexing, which suffers from the infamous “curse of the dimensionality”. In this tutorial we will introduce the challenges of indexing and searching high-dimensional data, and present the most recent tools available to “tame the curse”. At the end, the audience will have a good grasp of the current state of the art, the most promising research trends and the challenges still faced by the technology.

The tutorials, as I understand, are open to all participants on the conference. Mine will be held on Wednesday, October 7th from 14h40 to 18h20, with a 20′ coffee-break. If you use Google calendar, you can save the date by clicking on the button below.

* * *

I’ve unintentionally let an awful lot of of time pass since my last post — the move to Campinas (and to UNICAMP) has been wonderful, but also laborious. I thought that after moving across countries three times, moving across states would be a piece of cake, but it seems that, no matter the distance, moving is always a lot of hassle!

EDIT 11/11/09: The tutorial presentation, for the moment without narrative, is available on my talks and courses page.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s