========================================= The 11th IEEE/ACM International Conference on Grid Computing (Grid2010) Brussels, Belgium Oct 24 — Oct 29, 2010 http://www.grid2010.org/ Co-located with Open Grid Forum (OGF30) Sponsored by: The IEEE Computer Society Technical Committee on Scalable Computing (final approval pending) ========================================= Grid computing enables the sharing of distributed computing and data resources such as processing, network bandwidth and storage capacity to create a cohesive resource environment for executing distributed applications. The Grid conference series is an annual international meeting that brings together a community of researchers, developers, practitioners, and user involved with Grid technology. The objective of the meeting is to […]

Workshop on Web Personalization and Recommender Systems (WebPRES’10) in conjunction with the 2010 IEEE/WIC/ACM International Conference on Web Intelligence (WI’10) and Agent Technology (IAT’10) August 31, 2010, Toronto, Canada Homepage: http://www.webpres-workshop.com/ ++++++++++++++++ Description ++++++++++++++++ Nowadays, the abundance and popularity of Web applications, such as blogs, discussion forums, social and professional networks, flood users with huge volumes of information and various new sources of knowledge, and hence pose a great challenge of information overloading. Web personalization and recommender systems are two important technologies that attempt to cope with such information overloading problem in Web intelligence. Web personalization systems serve users with […]

Second Workshop Grids Meet Autonomic Computing (GMAC’10) Associated with the 7th International Conference on Autonomic Computing & Communications Washington DC, USA, 7 June 2010 http://gmac2010.lri.fr/index.php/GMAC_2010 *IMPORTANT DATES* Full paper submission: 15 February 2010 Author notification: 15 March 2010 Final version due: April 2010 *SCOPE* The design of effective and efficient Dynamic Distributed Applications is one of the key challenges shared by Cloud Computing and Grids. A special focus of this second edition of GMAC will thus be application-level autonomics. Production grids and experimental grid infrastructures have accumulated a precious experience concerning the needs of e-Science applications, the limitations of the […]

CSL 2010 First Call for Papers The Annual Conference of the European Association for Computer Science Logic August 23-27, 2010, Brno, Czech Republic http://www.mat.uc.pt/~csl/ Submission (title & abstract): March 26, 2010 Notification: May 17, 2010 Submission (full paper): April 2, 2010 Final papers: June 6, 2010 Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. The 19th EACSL Annual Conference on Computer Science Logic (CSL 2010) and the […]

PODC is probably one of the best conference for distributed computing, here is the call for papers for PODC 2010. CFP in pdf Papers are to be submitted electronically, following the guidelines available on the conference web page. Note that abstracts of regular papers must be submitted one week before the full papers; Note also that the deadlines are firm. A submission for a regular presentation must report on original research. Papers submitted for regular presentations must contain results that have not previously appeared, and have not been concurrently submitted to a journal or conference with published proceedings. Any partial […]

Together with Alexandre Borghi and Jérome Darbon, we wrote a paper entitled Exact Optimization for the $latex l^1$-Compressive Sensing problem using a Modified Dantzig-Wolfe method. the paper is available as a UCLA CAM Report here: cam09-101.pdf Here is the abstract: This paper considers the $latex l^1$-Compressive Sensing problem and presents an efficient algorithm that computes an exact solution. The idea consists in reformulating the problem such that it yields a modified Dantzig-Wolfe decomposition that allows to efficiently apply all standard simplex pivoting rules. Experimental results show the superiority of our approach compared to standard linear programming methods. Comments are more […]

Qest is a conference that I like for many reasons, and here is the call for papers for the 2010 edition of the conference. The conference website is here. Scope and Topics The International Conference on Quantitative Evaluation of SysTems (QEST) is the leading forum on evaluation and verification of computer systems and networks, through stochastic models and measurements. QEST has a broad range of interest — the common thread is that the evaluation be quantitative. The range of performance metrics of interest spans classical measures involving performance and reliability, as well as quantification of properties that are classically qualitative, […]

First International Workshop on Quantitative Stochastic Models in the Verification and Design of Software Systems (QUOVADIS) Workshop at the ICSE 2010 3rd May 2010, Cape Town, South Africa http://deepse.dei.polimi.it/quovadis/ Motivation and Objectives: ========================== Modern software systems are increasingly complex and pervasive. They are often offered to clients as services, which must meet high level expectations in terms of predictability. They are embedded in a fluid environment that is constantly evolving, because of changes in the requirements, in the operating environment, and in usage profiles. Traditional software development processes and methods are unable to cope with the challenges posed by this […]

To find the beginning of the triangular adventure, you should read this post. To prove the lemma we use the following theorem that I am not proving in this post (if you want the proof, just let me know). Theorem Consider $latex N$ urns each filled with $latex m$ balls, and the following process: pick a ball in an urn chosen uniformly at random until the chosen urn is empty. The probability that one had to pick more than $latex O(N^{\frac{m-1}{m}})$ balls tends to a nonzero constant as $latex N$ goes to infinity. Proof (of the lemma) To each triangle […]

======================================================================= SPAA 2010 Call for Papers 22nd ACM Symposium on Parallelism in Algorithms and Architectures Santorini, Greece June 13-15, 2010 http://www.spaa-conference.org ======================================================================= SCOPE: Contributed papers are sought in all areas of parallel algorithms and architectures. SPAA defines the term « parallel » broadly, encompassing any computational system that can perform multiple operations or tasks simultaneously. Topics of interest include, but are not limited to: – Parallel and Distributed Algorithms and Applications – Parallel and Distributed Data Structures – Parallel Complexity Theory – Parallel and Distributed Architectures – Multi-Core Architectures – Instruction Level Parallelism and VLSI – Compilers and Tools for Concurrent Programming […]