-------- Original-Nachricht -------- Betreff: [computational.science] CFP SISAP 2013 Datum: Fri, 8 Mar 2013 13:18:39 +0100 Von: Pavel Zezula zezula@fi.muni.cz Organisation: "ICCSA" An: Computational Science Mailing List computational.science@lists.iccsa.org
========================= SISAP 2013 - CALL FOR PAPERS =========================
We apologize if you receive duplicates of this CFP.
Please feel free to distribute it to those who might be interested.
SISAP 2013: 6th International Conference on Similarity Search and Applications October 2-4, 2013 A Coruna, Spain
Web site: http://www.sisap.org/2013
Facebook: http://www.facebook.com/sisap2013
Twitter: http://twitter.com/sisap2013,
Scope
The International Conference on Similarity Search and Applications (SISAP) is an annual forum for researchers and application developers in the area of similarity data management. It aims at the technological problems shared by numerous application domains, such as data mining, information retrieval, computer vision, pattern recognition, computational biology, geography, biometrics, machine learning, and many others that need similarity searching as a necessary supporting service.
The SISAP initiative (www.sisap.org) aims to become a forum to exchange real-world, challenging and innovative examples of applications, new indexing techniques, common test-beds and benchmarks, source code and up-to-date literature through its web page, serving the similarity search community. Traditionally, SISAP puts emphasis on the distance-based searching, but in general the conference concerns both the effectiveness and efficiency aspects of any similarity search problem.
The series started in 2008 as a workshop and has developed over the years into an international conference with Lecture Notes in Computer Science (LNCS) proceedings. As in previous editions, a small selection of the best papers presented at the conference will be recommended for inclusion in a special issue of Information Systems. In October 2013, SISAP will take place in A Coruna, Spain.
Keynote Speakers
Ricardo Baeza-Yates (VP of Yahoo! Research for Europe, Middle East and Latin America)
Jiri Matas (Center for Machine Perception, Czech Technical University)
Topics of interest
The specific topics include, but are not limited to:
Similarity queries - k-NN, range, reverse NN, top-k, etc.
Similarity operations - joins, ranking, classification, categorization, filtering, etc.
Evaluation techniques for similarity queries and operations
Merging/combining multiple similarity modalities
Cost models and analysis for similarity data processing
Scalability issues and high-performance similarity data management
Feature extraction for similarity-based data findability
Test collections and benchmarks
Performance studies, benchmarks, and comparisons
Similarity Search over outsourced data repositories
Similarity search cloud services
Languages for similarity databases
New modes of similarity for complex data understanding
Applications of similarity-based operations
Image, video, voice, and music (multimedia) retrieval systems
Similarity for forensics and security
Important Dates
Abstract submission: May, 3rd, 2013
Paper submission: May, 10th, 2013
Notification: June, 21st, 2013
Final version: July, 10th, 2013
Conference: October 2-4, 2013
Submission guidelines
Papers submitted to SISAP 2013 must be written in English and formatted according to the LNCS guidelines. Full papers can be up to 12 pages, while short papers, case-studies/applications, and demos can be up to 6 pages (read below for types of contribution). By submitting a paper, its authors commit to have the paper presented at the conference by at least one of them if the paper is accepted.
Contributions
Authors are invited to submit previously unpublished papers on their research in the area of similarity search and applications. Papers should present original research contributions which bring out the importance of algorithms to applications. SISAP submissions can be of three kinds:
Research papers (full and short): SISAP accepts both full (12 pages) and short papers (6 pages). The full papers are expected to be descriptions of complete technical work, while the short papers will describe interesting, innovative ideas, which nevertheless require more work to mature - vision papers should also be submitted as short papers. All papers, regardless of size, will be given an entry in the conference proceedings.
Case-studies and applications: Submissions describe applications of existing similarity search technologies to interesting problems, including a description of the encountered challenges, how they were overcome, and the lessons learned. All papers on this track will be given an entry in the conference proceedings and a presentation slot, though the presentation slot duration may be shorter than for full research papers.
Demonstration papers: Submissions should provide the motivation for the demonstrated concepts, the information about the technology and the system to be demonstrated (including a system description, functionality and figures when applicable), and should state the significance of the contribution. Evaluation criteria for the demonstration proposals include: the novelty, the technical advances and challenges, and the overall practical attractiveness of the demonstrated system. Demonstration papers will also be given an entry in the conference proceedings - online demos are expected at the conference.
Program comittee chairs
Pavel Zezula, Masaryk University, Czech Republic
Nieves R. Brisaboa, Universidade da Coruna, Spain
Program comittee members
Giuseppe Amato, ISTI - Istituto di Scienza e Tecnologia dell'Informazione, Italy
Laurent Amsaleg, IRISA - Institut de Recherche en Informatique et Systemes Aleatoires, France
Benjamin Bustos, Universidad de Chile, Chile
Edgar Chavez, Universidad Michoacana, Mexico
Paolo Ciaccia, University of Bologna, Italy
Richard Connor, Strathclyde University, UK
Andrea Esuli, Istituto di Scienza e Tecnologie dell'Informazione, Italy
Rosalba Giugno, University of Catania, Italy
Michael Houle, National Institute of Informatics, Japan
Alexis Joly, INRIA, France
Daniel Keim, Universitat Konstanz, Germany
Eamonn Keogh, University of California - Riverside, USA
Magnus Lie Hetland, Norwegian University of Science and Technology, Norway
Yannis Manolopoulos, Aristotle University of Thessaloniki, Greece
Rui Mao, Shenzhen University, China
Luisa Mico, University of Alicante, Spain
Henning Muller, University of Applied Sciences Western Switzerland, Switzerland
Gonzalo Navarro, Universidad de Chile, Chile
Arlindo Oliveira, Lisbon Technical University, Portugal
Jose Oncina, University of Alicante, Spain
Apostolos Papadopoulos, Aristotle University of Thessaloniki, Greece
Marco Patella, University of Bologna, Italy
Vladimir Pestov, University of Ottawa, Canada
Matthias Renz, Ludwig-Maximilians-Universitat Munchen, Germany
Hanan Samet, University of Maryland, USA
Tomas Skopal, Charles University in Prague, Czech Republic
Bjorn Thor Jonsson, Reykjavik University, Iceland
Local organization
Nieves R. Brisaboa, Universidade da Coruna, Spain
Oscar Pedreira, Universidade da Coruna, Spain