Last CFP: Engineering Large-Scale Distributed Systems Track at SAC08
"Claudio Lucchese" <[email protected]> Thu, 30 Aug 2007 08:44:53 -0000
| Newsgroups | gmane.comp.information-retrieval.webir |
|---|---|
| Message-ID | <[email protected]> |
Call For Papers Engineering Large-Scale Distributed Systems [http://sac08.isti.cnr.it/] at SAC 2008 [http://www.acm.org/conferences/sac/sac2008/] Social phenomena like YouTube and Flickr are incontrovertible evidence of users' migration to a new Web overwhelmed by multimedia. In fact, images, videos, music, and other kinds of multimedia objects today constitute about 99% of the Web. Nonetheless, users' chances of a successful search in such a large portion of information are not proportionally supported. Web search is dominated by giants like Google, Yahoo! and Microsoft that exploit centralized text-only indices enriched by an endless toolbox of smart ranking algorithms. Their interest in riding this new tide is witnessed by the acquisition of both Flickr and YouTube. On the other hand, content-based search for image, music and videos has been deeply studied in the last years but it is not yet adopted by the industry because of its cost. At the same time users are becoming more and more active. There is no doubt that the so called "Web 2.0" marked a new approach of generating and distributing Web content itself, characterized by communities, decentralization of authority, freedom to share and re-use. It is fascinating the opportunity to develop distributed search engines taking advantage of distributed resources controlled by communities, interest groups, single users or providers. In the last few years Peer-to-Peer systems have been widely used to overcome scalability issues of centralized solutions. P2P algorithms offer robust, scalable and highly available ways of exploiting large pools of storage and computational resources. The approach has been shown to be effective for tasks such as file sharing. In addition, academic research started contributing new insights and paving new promising outlooks for P2P networks. P2P seems the solution that can make a large multimedia information retrieval system able to scale to repositories as large as the Web is. Also, P2P is supposed to lead users to freedom from advertisement-generating, commercial and centralized web search engines. Users interests are not the same of web search engines. Topics of Interest Authors are invited to submit papers dealing with the following topics: . Algorithms for data distribution and search on P2P networks . Distributed indexing, search, and retrieval of multimedia data . Architectures for large-scale distributed systems . Multimedia query languages, query processing and optimization for distributed systems . Efficient and scalable distributed data storage and management . Datasets, tools, benchmarks and standards . Large-scale mobile networks . Trust and reputation management in distributed systems . Innovative approaches to copyright management in distributed systems Chairs Fabrizio Falchi, [email protected], NMIS lab, ISTI-CNR, Pisa, Italy Claudio Lucchese, [email protected], Ca' Foscari University of Venice, Italy Program Committee . Maristella Agosti, University of Padova, Italy. . Ralitsa Angelova, MPII, Germany. . Ricardo Baeza-Yates, Yahoo! Research, Spain. . Flavio Junqueira, Yahoo! Research, Spain. . Mouna Kacimi, MPII, Germany. . Yosi Mass, IBM Research Haifa, Israel. . Salvatore Orlando, Ca' Foscari University of Venice, Italy. . Raffaele Perego, ISTI-CNR, Italy. . Josiane Xavier Parreira, MPII, Germany. . Vassilis Plachouras, Yahoo! Research, Spain. . Ivana Podnar Zarko, FER, University of Zagreb, Croatia. . Diego Puppin, University of Pisa, Italy. . Fausto Rabitti, ISTI-CNR, Italy. . Fabrizio Silvestri, ISTI-CNR, Italy. . Gleb Skobeltsyn, EPFL, Switzerland. . Michalis Vlachos, TJ Watson IBM, USA. . Philip S. Yu, TJ Watson IBM, USA. . Pavel Zezula, Masaryk University, Czech Republic. Submission Guidelines Only original papers from the above mentioned or other related areas will be considered. Parallel submission to other conferences or other tracks of SAC 2008 is forbidden. Each paper will be undergo a DOUBLE BLIND review process by at least three referees. Authors must hence not use identifying information in the text of the paper and bibliographies must be referenced to preserve anonymity. All submissions must be formatted using the ACM conference-specific LaTeX style, which can be obtained from the symposium webpage (http://www.acm.org/conferences/sac/sac2008/downloads08.htm). The standard paper length is 5 pages. Up to 8 pages can be accepted for an additional fee. IMPORTANT: Submissions will have to go through a global SAC 2008 site. http://sac.cs.iupui.edu/SAC2008/login.aspx?ReturnUrl=%2fSAC2008%2fSubmitAbstract.aspx Important Dates . 8 September 2007 : Submission of papers . 16 October 2007 : Notification of Acceptance/Rejection . 30 October 2007 : Camera-Ready copies of accepted papers