Follow up on last year’s paper, new results on kernelization (via sampling) are to be published in SODA 2016. “Kernelization via sampling with applications to dynamic graph streams” is joint work with Rajesh Chitnis, Hossein Esfandiara, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh and Sofya Verotnikova.
A funded studentship is available in the area of computer science to work on algorithms and data structures for summarization of massive data sets. Funding is provided through the prestigious ERC program, under project 647557, “Small Summaries for Big Data”.
A fundamental challenge in processing the massive quantities of information generated by modern applications is in extracting suitable representations of the data that can be stored, manipulated and interrogated on a single machine. A promising approach is in the design and analysis of compact summaries: data structures which capture key features of the data, and which can be created effectively over distributed data sets. Popular summary structures include the Bloom filter, which compactly represents a set of items, and sketches which allow vector norms and products to be estimated.
Such structures are very attractive, since they can be computed in parallel and combined to yield a single, compact summary of the data. Yet the full potential of summaries is far from being fully realized. Professor Cormode is recruiting a team to work on important problems around creating Small Summaries for Big Data. The goal is to substantially advance the state of the art in data summarization, to the point where accurate and effective summaries are available for a wide array of problems, and can be used seamlessly in applications that process big data. PhD studentships can work on a variety of topics related to the project, including:
• The design and evaluation of new summaries for fundamental computations such as large matrix computations
• Summary techniques for complex structures such as massive graphs
• Summaries that allow the verification of outsourced computation over big data.
• Application of summaries in the context of monitoring distributed, evolving streams of data
The expectation is that this will lead to novel results in the summarization of large volumes of data, which will be published in top-rated venues.
You will possess a degree in Computer Science, mathematics or very closely related discipline (or you will shortly be obtaining it). You should have good knowledge of one or more of the following areas: algorithm design and analysis; randomized and approximation algorithms; communication complexity and lower bounds; streaming or sublinear algorithms. The post is based in the Department of Computer Science at the University of Warwick, but collaborations with closely related research organizations such as the centre for Discrete Mathematics and its Applications (DIMAP), the Warwick Institute for the Science of Cities (WISC); and the newly formed Alan Turing Institute (ATI) will be strongly encouraged.
For examples of relevant research and related topics, please consult Prof. Cormode’s web pages at http://www2.warwick.ac.uk/fac/sci/dcs/people/Graham_CormodeEligibility:
Candidates should hold a degree in Computer Science, Mathematics or closely related discipline, or expect to complete one before the commencement of the studentship. The degree should show a high level of achievement (1st or 2.1 level).
Funding is available to support stipend and fees at the UK/EU level for 4 years (this does not cover fees for non-EU students, see http://www2.warwick.ac.uk/study/postgraduate/funding/fees/ for more information).
Please send a CV to firstname.lastname@example.org giving details of your education and achievements to date, including details of performance in relevant university-level subjects (such as Algorithms, Data Structures, Complexity, Mathematical analysis of algorithms, linear algebra and so on). Please also include a covering note explaining how your background and interests make you relevant to the aims of the project.
Applications will be reviewed as they are received, with an initial deadline of November 30th 2015, and a final deadline of 31st March 2016.This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 647557).
Funding is available to support stipend and fees at the UK/EU level for 4 years (this does not cover fees for non-EU students, see View Website for more information).
Dr Hossein Jowhari has joined the ERC project “Small Summaries for Big Data”, led by Professor Graham Cormode, as a postdoctoral research assistant. Dr Jowhari has made foundational contributions to the area of data summarization, most notably his work on Lp sampling. Prior to joining Warwick, Hossein completed his PhD at Simon Fraser University, and spent time as a researcher at the Madalgo centre.
We are seeking to recruit a Post-doctoral Research Fellow to work in the area of algorithms for analysing large data sets. The position is based at the University of Warwick, in the United Kingdom (UK).
You will be expected to perform high quality research under the supervision of Professor Graham Cormode, as part of the ERC funded project ‘Small Summaries for Big Data’. This can encompass streaming algorithms, sketching and dimensionality reduction, distributed monitoring and mergable summaries, verification of outsourced computation, or other related topics. The expectation is that you will produce breakthough research results in the summarisation of large volumes of data, and publish these results in top rated venues.
You will possess a PhD or an equivalent qualification in Computer Science or a very closely related discipline (or you will shortly be obtaining it). You should have a strong back ground in one of the following areas: algorithm design and analysis; randomised and approximation algorithms; communication complexity and lower bounds; streaming or sublinear algorithms. The post is based in the Department of Computer Science at the University of Warwick, but collaborations with closely related research organisations such as the Centre for Discrete Mathematics and its Applications (DIMAP), the Warwick Institute for the Science of Cities (WISC) and the newly formed Alan Turing Institute (ATI) will be strongly encouraged.
Candidates should provide with their application form a CV, a list of publications and a research statement.
Closing date: 2nd July 2015
More information: http://www.jobs.ac.uk/job/ATV907/research-fellow-75814-065/
A paper titled “Conservative or liberal? personalized differential privacy” is published in ICDE 2015, joint work with Zach Jorgensen and Ting Yu.
A paper called “Private release of graph statistics using ladder functions” will be published in SIGMOD 2015, joint work with Jun Zhang, Magda Procopiuc, Divesh Srivastava, and Xiaokui Xiao.
Both papers are concerned with publishing data under a model of differential privacy, which perturbs the input to protect the privacy of the participating individuals.
Graham Cormode has been awarded a prestigious ERC consolidator grant worth 1.5M euro, to support his research. The grant is for a project entitled “Small Summaries for Big Data”. The project focuses on the area of the design and analysis of compact summaries: data structures which capture key features of the data, and which can be created effectively over distributed data sets. The project will substantially advance the state of the art in data summarization, to the point where accurate and effective summaries are available for a wide array of problems, and can be used seamlessly in applications that process big data.
The University of Warwick department of Computer Science was rated second in the country in the recent REF exercise run by the UK government.
The University is also one of five selected to take part in the Alan Turing Institute, a new venture designed to lead British research in Computer Science. The department of computer science, along with Mathematics and Statistics, will lead the university’s involvement.