*******************************************
* Submission deadline extended to July 9 *
*******************************************
IMPORTANT DATES
Paper submission: July 9th, 2010
Notification of acceptance: August 16th, 2010
Final version submission: September 5th, 2010
3rd International Conference on SImilarity Search and APplications (SISAP 2010)
Conference September 18.-19., 2010 - Istanbul, Turkey
BACKGROUND
The International Conference on Similarity Search and Applications
(SISAP) is a conference devoted to similarity searching, with emphasis
on metric space searching. It aims to fill in the gap left by the
various scientific venues devoted to similarity searching in spaces
with coordinates, by providing a common forum for theoreticians and
practitioners around the problem of similarity searching in general
spaces (metric and non-metric) or using distance-based (as opposed to
coordinate-based) techniques in general.
SISAP aims to become an ideal forum to exchange real-world,
challenging and exciting examples of applications, new indexing
techniques, common testbeds and benchmarks, source code, and
up-to-date literature through a web page serving the similarity
searching community. Authors are expected to use the testbeds and code
from the SISAP web site for comparing new applications, databases,
indexes and algorithms.
After the very successful first events in Cancun, Mexico (2008) and
Prague, Czech Republic (2009), this year SISAP conference will be held
in Istanbul, Turkey, on September 18-19, 2010.
The four best papers will be invited to be published in a special
issue of Journal of Discrete Algorithms (Elsevier). SISAP 2010 is
organized in cooperation with ACM SIGSPATIAL and the papers will be
indexed in the ACM Digital Library.
CALL FOR PAPERS
Authors are encouraged to submit previously unpublished papers on
their research in similarity search and applications. The proceedings
of SISAP 2010 will be published in cooperation with ACM. Extended
versions of the four best SISAP 2010 papers will be invited (subject
to additional reviewing) for publication in a special issue of the
Journal of Discrete Algorithms, published by Elsevier.
Contributions to the conference should fall into the following categories:
Full papers:
- Basic techniques: general methods that apply to arbitrary metric
spaces, nonmetric or (dis)similarity spaces, or high-dimensional
vector spaces. We strongly encourage that those be accompanied with an
open-source implementation conforming the interface of the Web site
and to be tested with a relevant subset of the spaces included in the
Web site. This will favor uniform comparison and also permit comparing
the technique with future developments.
- Applied techniques: methods that apply to specific similarity search
problems. Those papers are also encouraged to contribute with the code
and, especially, with the similarity computation function and the
datasets related to the specific problem they address (if they are
new), for the Web site.
Posters:
- Domain-specific spaces and similarities: papers that challenge and
motivate for searching in new spaces (i.e. domain-specific similarity
search). This type of contribution is expected to provide a thorough
study of the non/metric space properties (e.g., its intrinsic
dimension) or the similarity measure, and must include code for the
similarity computation and datasets for the Web site. For this kind of
paper a real-world domain-specific application of similarity search is
expected (e.g., multimedia databases, (bio)chemical & medical
databases, biometric databases, scientific & sensory databases, etc.).
Demos:
- Similarity retrieval engines: papers that present prototypical
non-commercial engine entirely devoted to similarity search
applications. The presentation should cover the domains of
applicability (e.g., image retrieval system), the architecture,
scalability, user interfaces, optional comparison with similar
engines, etc. This type of contribution must include either an
installation package of the demo application + database, or must be
installed as a web application accessible to the SISAP PC.
The topics of interest include, but are not limited to:
* Range search
* knn search
* Limited-range knn search
* Reverse knn search
* New complex similarity query types
* Similarity joins
* Clustering (applied to indexing)
* Parallelism & distributed algorithms
* Approximate searching
* Computation of intrinsic dimension
* Cost models
* Embeddings
* Languages for similarity databases
SUBMISSION INSTRUCTIONS
Papers must be submitted as pdf files and must not exceed 8 pages
(full papers), or 2 pages (posters or demos) and must adhere to the
standard ACM SIG Proceedings format. Formatting instructions and
LaTeX/Word macros are available on the ACM site
(http://www.acm.org/sigs/publications/proceedings-templates).
Additional appendices can use more pages but they will be read at the
discretion of the reviewer, so they should not be used for material
that is essential to understand the relevance of the contribution.
One author per paper is required to register and attend the conference
to present the paper if accepted for publication.
IMPORTANT DATES
Paper submission: July 9th, 2010
Notification of acceptance: August 16th, 2010
Final version submission: September 5th, 2010
PROGRAM COMMITTEE
* Edgar Chavez, Universidad Michoacana, Mexico
* Alfredo Ferro, Universita' di Catania, Italy
* Daniel Keim, Universitaet Konstanz, Germany
* Daniel Miranker, University of Texas at Austin, USA
* Gonzalo Navarro, Universidad de Chile, Chile
* Hanan Samet, University of Maryland, USA
* Tomas Skopal, Charles University in Prague, Czech Republic
* Agma Traina, University of Sao Paulo at Sao Carlos, Brazil
* Pavel Zezula, Masaryk University, Czech Republic
* Paolo Ciaccia (co-chair), Universita' di Bologna, Italy
* Marco Patella (co-chair), Universita' di Bologna, Italy
Local Organizing Committee: Cengiz Celik, Bilkent University, Turkey
CONFERENCE WEBSITE
For more and up-to-date information, please visit the conference website at URL:
http://www.sisap.org/2010
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
