Our work titled “Estimating Quantiles from the Union of Historical and Streaming Data” by Sneha Singh, Divesh Srivastava, and Tirthapura, has been accepted to VLDB 2017, which is a top-tier conference for database research.
Our work on Parallel Algorithms for a Basic Data Structure (Union-Find) invited to Special Issue for Best Papers from EuroPar 2016
Our work titled “Work-Efficient Parallel Union-Find With Applications to Incremental Graph Connectivity” by Simsiri, Tangwongsan, Tirthapura, and Wu was invited for submission to a special issue on Euro-Par 2016 in the journal “Concurrency and Computation: Practice and Experience”. This invitation is reserved for a few of the highest-rated papers in the conference.
This work presents a parallel version of the classic “Union-Find” data structure for maintaining and querying an equivalence relation. Among other applications, the Union-Find data structure can be directly used to maintain whether or not two vertices are connected in a graph, when the graph is changing through the addition of edges.
NSF Proposal “PFI:BIC- A Smart Service System for Traffic Incident Management Enabled by Large-data Innovations (TIMELI)” Awarded
Our proposal for the project “PFI:BIC- A Smart Service System for Traffic Incident Management Enabled by Large-data Innovations (TIMELI)” was recently funded by the National Science Foundation. http://nsf.gov/awardsearch/showAward?AWD_ID=1632116&HistoricalAwards=false
In my role as a co-PI in this project, I am working with a team of transportation engineers and data scientists, led by Anuj Sharma, to build better traffic incident management systems.
Minh Truong Defends his M.S. Project
Minh Truong defended his M.S. project titled “Endiary: Unifying Task, Calendar and Your Everyday Activities”. Congrats Minh!
“Work-Efficient Parallel and Incremental Graph Connectivity” accepted to Euro-Par 2016 Conference
Our work titled “Work-Efficient Parallel and Incremental Graph Connectivity”, authored by Natcha Simsiri, Kanat Tangwongsan, Srikanta Tirthapura, and Kun-Lung Wu has been accepted to appear in the Euro-Par 2016 Conference, to be help in Grenoble, France. This presents efficient methods implement the popular “Union Find” data structure in parallel, with an application to incremental graph connectivity. EuroPar is a high quality conference on parallel processing, held in Europe each year.
“Enumeration of Maximal Cliques from an Uncertain Graph” accepted to IEEE TKDE
The paper “Enumeration of Maximal Cliques from an Uncertain Graph” authored by Arko Mukherjee, Pan Xu, and Srikanta Tirthapura has been accepted to IEEE Transactions on Knowledge and Data Engineering (TKDE)
“Enumerating Maximal Bicliques from a large graph using MapReduce” Accepted to IEEE TSC
Our article “Enumerating Maximal Bicliques from a large graph using MapReduce”, authored by Arko Mukherjee and Srikanta Tirthapura, has been accepted to appear in a forthcoming issue of IEEE Transactions on Services Computing.
“A Simple Message-Optimal Algorithm for Random Sampling from a Distributed Stream” Accepted to IEEE TKDE
Research article titled “A Simple Message-Optimal Algorithm for Random Sampling from a Distributed Stream” has been accepted to IEEE Transactions on Knowledge and Data Engineering (TKDE). The authors are Yung-Yu Chung, Srikanta Tirthapura, and David Woodruff
Welcome Yesdaulet!
Yesdaulet Izenov has joined our group as a Master’s student. Welcome Yesdaulet!
An Evaluation of Streaming Algorithms for Distinct Counting over a Sliding Window
Research Article “An Evaluation of Streaming Algorithms for Distinct Counting over a Sliding Window“, by Sneha Aman Singh, Srikanta Tirthapura, published in Frontiers in ICT, section Big Data. Access the article here (this is open access, hence freely available) (link)