SECCO 2010 Call For Papers

April, 23, 2010
Sylvain

SecCo 2010 Paris, France Monday, August 30th, 2010 http://www.win.tue.nl/~kostas/SecCo2010/ Affiliated with Concur 2010 IMPORTANT DATES =============== Papers due: June 1st, 2010 Notification: July 9th, 2010 Final paper due: July 23rd, 2010 Workshop: August 30th, 2010 BACKGROUND, AIM AND SCOPE ========================= Emerging trends in concurrency theory require the definition of models and languages adequate for the design and management of new classes of applications, mainly to program either WANs (like Internet) or smaller networks of mobile and portable devices (which support applications based on a dynamically reconfigurable communication structure). Due to the openness of these systems, new critical aspects come into […]

Read More

WISE 2010 Call For Papers

April, 19, 2010
Sylvain

The aim of this eleventh edition of the conference series on Web Information Systems Engineering is to provide an international forum for researchers, professionals, and industrial practitioners to share their knowledge in the rapidly growing area of Web technologies, methodologies and applications. Previous WISE conferences were held in Hong Kong, China (2000), Kyoto, Japan (2001), Singapore (2002), Roma, Italy (2003), Brisbane, Australia (2004), New York, USA (2005), Wuhan, China (2006), Nancy, France (2007), Auckland, New Zealand (2008), and Poznan, Poland (2009). The proceedings of WISE 2010 will be published in 2 separate volumes by Springer in its Lecture Notes in […]

Read More

WSDM 2011 Call For Papers

April, 16, 2010
Sylvain

WSDM (pronounced “wisdom”) is the premier international ACM conference covering research in the areas of search and data mining on the Web. The 4th ACM WSDM Conference will take place in Hong Kong, during February 9-12, 2011.WSDM publishes original, high quality papers and presentations related to search and data mining on the Web and the Social Web, with an emphasis on practical but principled novel models of search, retrieval and data mining, algorithm design and analysis, economics implications, and in-depth experimental analysis of accuracy and performance. WSDM2011 will have keynotes, invited talks, full paper presentations, posters, tutorials, workshops, social events, […]

Read More

Detecter la vente de liens ?

April, 13, 2010
Sylvain

La vente de liens c’est un peu la grosse affaire, grosse affaire pour celui qui vend les liens, grosse affaire pour le casinotier webmaster qui en achète, mais surtout grosse affaire pour notre ami le grand Google pour qui la vente de liens est une incarnation directe et tangible du grand diable qui sommeille tapie au sein de chacun d’entre nous. Pendant longtemps le sujet n’avait jamais été abordé par qui que ce soit et le business de la vente se passait tranquillement, à la vue de qui voulait voir, mais sans publicité excessive. Mais en 2006, Google a décidé […]

Read More

ISAAC 2010 – Call For Papers

April, 11, 2010
Sylvain

The 21st International Symposium on Algorithms and Computation (ISAAC 2010) will be held in Jeju Island, Korea, December 15-17, 2010. The symposium is intended to provide a forum for researchers working in algorithms and theory of computation. Papers presenting original research in the areas of algorithms and theory of computation are sought. Papers in relevant applied areas are also welcome. Topics The topics include, but are not limited to: – Algorithms and data structures – Approximation algorithms – Combinatorial optimization – Computational biology – Computational complexity – Computational geometry – Cryptography – Experimental algorithms – Graph drawing and graph algorithms […]

Read More

New paper!

March, 31, 2010
Sylvain

I am pleased to announce that the following paper is accepted as a brief announcement at SPAA 2010: Brief announcement: Lower bounds on communication for sparse Cholesky factorization of a model problem. Laura Grigori, Pierre-Yves David, James Demmel and Sylvain Peyronnet. In the paper we derive bounds on communication for sparse Cholesky factorization . We focus our analysis on matrices whose graphs satisfy a property, from which a lower bound on the number of flops of the Cholesky factorization can be derived. More information? read the paper!

Read More

ESA 2010 Call For Papers

March, 10, 2010
Sylvain

The European Symposium on Algorithms covers research in the design, use, and analysis of efficient algorithms and data structures. ESA will be held as part of ALGO 2010, in conjunction with several other workshops, hosted by the Liverpool University Department of Computer Science. Dates: 6-8 September 2010 http://algo2010.csc.liv.ac.uk/esa/ Topics Areas covered in ESA include: * Algorithmic aspects of networks * Algorithmic game theory * Approximation algorithns * Combinatorial optimization * Computational biology * Computational finance * Distributed computing * Computational geometry * Data compression * Data structures * Databases and information retrieval * Graph algorithms * Hierarchical memories * Machine […]

Read More

SSS 2010 Call For Papers

March, 6, 2010
Sylvain

12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2010) http://www.cs.bgu.ac.il/~dolev/SSS10/ New York City, USA September 20-22, 2010 Davis Auditorium, Columbia University _________________________________________________________________ Invited speakers Leonid Levin, Boston University, USA Mihalis Yannakakis, Columbia University, USA Yechiam Yemini, Columbia University, USA _________________________________________________________________ Important Dates * Submission deadline: May 21, 2010 * Acceptance notification: July 05, 2010 * Camera-ready copy due: July 14, 2010 * Arrival date: September 19, 2010 * Conference begins: September 20, 2010 * Conference ends: September 22, 2010 ____________________________________________________________ General Chair Shlomi Dolev Ben-Gurion Univ., Israel Program Co-Chairs Jorge Cobb U of Texas at Dallas, […]

Read More

SAGT 2010 Call For Papers

March, 6, 2010
Sylvain

—————————————————————— CALL FOR PAPERS 3rd International Symposium on Algorithmic Game Theory October 18–20, 2010 Athens, GREECE http://sagt2010.cti.gr/ —————————————————————— IMPORTANT DATES ————— SUBMISSION DEADLINE May 3, 2010, 24:00 GMT / 12:00pm GMT NOTIFICATION OF AUTHORS June 28, 2010 CAMERA READY SUBMISSION July 27, 2010 SYMPOSIUM DATES October 18-20, 2010 —————————————————————— PURPOSE ——- The purpose of SAGT is to bring together researchers from Computer Science, Economics and Mathematics to present and discuss original research at the intersection of Algorithms and Game Theory. —————————————————————— SCOPE —– Authors are invited to submit previously unpublished work for possible presentation at the conference. New foundational work […]

Read More

RecSys 2010 Call For Papers

March, 5, 2010
Sylvain

ACM Recommender Systems 2010 Barcelona :: September 26-30, 2010 Call For Papers CALL FOR PAPERS, PRESENTATIONS, AND DEMOS We are pleased to invite you to participate in the premier annual event on research and applications of recommendation technologies, the Fourth ACM Conference on Recommender Systems. The previous conferences in Minneapolis, Lausanne and New York have been distinguished by a strong level of interaction between practitioners and researchers in the sharing of ideas, problems and solutions, and the 2010 conference will continue in this tradition. The fully-refereed proceedings will be published by the ACM and, like past RecSys proceedings, are expected […]

Read More
Picture: courtesy of Abby Blank