Skip to main content Skip to navigation

Recent News

Select tags to filter on

Summer School on Hashing and Applications

Hashing is used everywhere in computing and is getting increasingly important with the exploding amount of data. A summer school at the University of Copenhagen provided an in-depth introduction to hashing, both theory and applications. The topics ranged from modern theory of hashing, to actual implementations of hash functions that are both efficient and provide the necessary probabilistic guarantees. Application areas studied, included sketching and data bases, similarity estimation, and machine learning.

Slides from the summer school are available now, and videos will be uploaded soon.

Mon 21 Jul 2014, 12:00 | Tags: talks, research

PrivBayes paper presented at SIGMOD 2014

The paper "Privbayes: Private data release via bayesian networks" was presented at the ACM SIGMOD 2014 conference in Utah in June 2014. The paper is a collaboration between Graham Cormode (University of Warwick), Magda Procopiuc, Divesh Srivastava (AT&T Labs Research), Xiaokui Xiao, and Jun Zhang (NTU Singapore). It shows how the private data can be released under the model of differential privacy while preserving much of the original structure of the original data, by using the model of Bayesian networks. These identify the important correlations between attributes in the data, while avoiding the "curse of dimensionality".

Mon 21 Jul 2014, 11:54 | Tags: papers, research

Yahoo Faculty Research and Engagement Program Award

Prof Cormode is one of 25 researchers worldwide selected for a Yahoo! Faculty Research and Engagement Program (FREP) award. This award will support Prof Cormode's collaboration with Yahoo researchers into smart algorithms and data structures to allow large scale search and query suggestion over massive data sets.

Mon 21 Jul 2014, 11:50 | Tags: funding, research

Imre Simon Award for Count-Min Sketch

The paper “An improved data stream summary: The count-min sketch and its applications,” authored by Graham Cormode and S. Muthukrishnan, published in LATIN 2004, has been awarded the 2014 Imre Simon Test-of-Time Award.

The Imre Simon Award was created in 2012, with the aim of recognizing the papers published in LATIN which have had the most relevant and lasting impact. Since then, each edition of the conference awards a paper published in LATIN that is at least 10 years old, in order to assess its long-term impact in the area of Theoretical Computer Science. See http://www.latintcs.org/prize for more information.

For more information on the Count-Min sketch and its applications, see the Count-Min website.

Mon 21 Jul 2014, 11:42 | Tags: awards, research