Your Wit is my Command
Thursday, December 2, 2021
Please join us for this fun and exciting talk by Tony Veale. As an associate professor in the School of Computer Science at University College Dublin (UCD), Ireland, he has worked in AI research for three decades, in academia and in industry, with a special emphasis on humor and linguistic creativity.
Decision Problems in Information Theory
Thursday, January 2, 2020
Constraints on entropies are considered to be the laws of information theory. Even though the pursuit of their discovery has been a central theme of research in information theory, the algorithmic aspects of constraints on entropies remain largely unexplored. Here, we initiate an investigation of decision problems about constraints on entropies by placing several different such problems into levels of the arithmetical hierarchy.
Maintaining Triangle Queries under Updates
Thursday, January 2, 2020
We consider the problem of incrementally maintaining the triangle queries with arbitrary free variables under single-tuple updates to the input relations. We introduce an approach called IVM that exhibits a trade-off between the update time, the space, and the delay for the enumeration of the query result, such that the update time ranges from the square root to linear in the database size while the delay ranges from constant to linear time. IVM achieves Pareto worst-case optimality in the update-delay space conditioned on the Online Matrix-Vector Multiplication conjecture.
A Principled Approach to Selective Context Sensitivity for Pointer Analysis - TOPLAS
Wednesday, January 1, 2020
In this work, we present a more principled approach for identifying precision-critical methods, based on general patterns of value flows that explain where most of the imprecision arises in context-insensitive pointer analysis.
Bag Query Containment and Information Theory
Wednesday, January 1, 2020
The query containment problem is a fundamental algorithmic problem in data management. While this problem is well understood under set semantics, it is by far less understood under bag semantics. In this paper we unveil tight connections between information theory and the conjunctive query containment under bag semantics.
Computer Vision: Deep Dive into Object Segmentation Approaches
Wednesday, January 1, 2020
Join optimization has been dominated by Selinger-style, pairwise optimizers for decades. But, Selinger-style algorithms are asymptotically suboptimal for applications in graphic analytics. This suboptimality is one of the reasons that many have advocated supplementing relational engines with specialized graph processing engines.