Professor Eli Upfal of Brown University's Department of Computer Science (Brown CS) and his research group continue to distinguish themselves in the Big Data research community. Shortly after two of their full papers and one poster paper were accepted at the 22nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2016), a prominent Big Data conference, one of the papers has won the conference's Best Student Paper Award for the Research Track.
TRIEST: Counting Local and Global Triangles in Fully-dynamic Streams with Fixed Memory Size was a joint publication between Lead Researcher and PhD Candidate Lorenzo De Stefani, former Postdoctoral Research Associate Alessandro Epasto (now at Google), Visiting Assistant Professor of Computer Science Matteo Riondato, and Eli. The paper tackles the problem of triangle counting in large massive graphs. Their work proposes a new algorithm based on adaptive sampling, which provides high quality approximations of the number of triangles in large networks with probabilistic guarantees.
Two Sigma Labs, where Matteo works as a research scientist, has also published a news article on TRIEST that's available here.
For more information, please click the link that follows to contact Brown CS Communication Outreach Specialist Jesse C. Polhemus.
The image above is © 2016 by the Association for Computing Machinery.