Accepted papers

 

Full papers

 
  • Rank Cover Trees for Nearest Neighbor Search. Michael E. Houle and Michael Nett.
  • Text Categorization via Similarity Search: An Efficient and Effective Novel Algorithm. Hubert Haoyang Duan, Vladimir Pestov and Varun Singla.
  • Efficient approximate indexing in high-dimensional feature spaces. Simone Santini.
  • Similarity Sets: A Conceptual Basis to Seamlessly Include Similarity Queries in Data Base Management Systems. Ives Pola, Robson Cordeiro, Agma Traina and Caetano Traina.
  • Database Similarity Join for Metric Spaces. Yasin Silva, Spencer Pearson and Jason Cheney.
  • Engineering efficient and effective non-metric space library. Leonid Boytsov and Bilegsaikhan Naidan.
  • Outcome-Based Dynamic k-Nearest Neighbors Models for Search Engine Prediction. Christopher Wagner, Sahra Sedigh and Ali Hurson.
  • Evaluation of different metrics for shape based image retrieval using a new contour points descriptor. María Teresa García-Ordás, Enrique Alegre, Oscar García-Olalla and Diego García-Ordás.
  • Pivot selection strategies for permutation-based similarity search. Giuseppe Amato, Fabrizio Falchi and Andrea Esuli.
  • Evaluation of LBP variants using several metrics and kNN classifiers. Oscar García-Olalla, Enrique Alegre, Maria Teresa García-Ordás and Laura Fernández-Robles.
  • Quantized Ranking for Permutation-based Indexing. Hisham Mohamed and Stéphane Marchand-Maillet.
  • Beyond Bag of Words for Concept Detection and Search of Cultural Heritage Archives. Costantino Grana, Giuseppe Serra, Marco Manfredi and Rita Cucchiara.
  • (Very) Fast (All) k-Nearest Neighbors in Metric and Non Metric Spaces Without Indexing. Natalia Miranda, Edgar Chavez, María Fabiana Piccoli and Nora Reyes.
  • List of Clustered Permutations for Proximity Searching. Karina Figueroa and Rodrigo Paredes.
  • Extreme Pivoting for Faster Indexes. Guillermo Ruiz, Francisco Santoyo, Edgar Chavez, Karina Figueroa and Eric Sadit Tellez.
  • Large Scale Image Retrieval Using Vector of Locally Aggregated Descriptors. Giuseppe Amato, Paolo Bolettieri, Fabrizio Falchi and Claudio Gennaro.
  • Machine learning for image classification and clustering using a universal distance measure. Joel Ratsaby and Uzi Chester.
  • Quicker similarity joins in metric spaces. Kimmo Fredriksson and Billy Braithwaite.
  • Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees. Kunihiro Wasa, Hiroki Arimura, Kouichi Hirata and Takeaki Uno.
  • Longest Common Subsequence in k Length Substrings . Gary Benson, Avivit Levy and B. Riva Shalom.
 

Short papers

 
  • Semi-Supervised Tag Extraction in a Web Recommender System. Vasily Leksin and Sergey Nikolenko.
  • Similarity Search on Uncertain Spatio-Temporal Data. Johannes Niedermayer, Andreas Zuefle, Tobias Emrich, Matthias Renz, Nikos Mamoulis, Lei Chen and Hans-Peter Kriegel.
  • A Similarity Model for 3D Objects Based on Stable Sub-Clouds. Markus Mauder, Peer Kröger and Karl-Ludwig Schinner.
  • Principal directions-based pivot placement. Fabrizio Angiulli and Fabio Fassetti.
  • Evaluation of Jensen-Shannon Distance over Sparse Data. Richard Connor, Robert Moss, Franco Alberto Cardillo and Fausto Rabitti.
  • A Multi-Way Divergence Metric. Robert Moss and Richard Connor.
  • Design Database Indexing Methods with Parallel Genetic Programming. Tomas Bartos and Tomas Skopal.
  • Optimal Distance Bounds for the Mahalanobis Distance. Tobias Emrich, Gregor Jossé, Hans-Peter Kriegel, Markus Mauder, Johannes Niedermayer, Matthias Renz, Matthias Schubert and Andreas Zuefle.
  • On Approximate Search with the Signature Quadratic Form Distance. Jakub Lokoc, Tomas Grosup and Tomas Skopal.
 

Demos

 
  • PFMFind: a system for discovery of peptide homology and function. Aleksandar Stojmirovic, Peter Andreae, Mike Boland, T. William Jordan and Vladimir Pestov.
  • Retrieving Similar Movements in Motion Capture Data. Jan Sedmidubsky and Jakub Valcik.