Abstract: In this talk, we shall look at logics over words. It is known that first order logic (FO) with an order relation, <, defines exactly the set of all aperiodic regular languages.
Abstract: In the orienteering problem, we are given a metric space (the distances are supposed to represent travel times between the locations), a start vertex ("home") and a deadline B, and want to visit as many points as possible using a tour of
Abstract: Recovering a low-rank matrix or tensor from incomplete or corrupted observations is a recurring problem in signal processing and machine learning.
Abstract: Determinantal point processes form an important class of point processes with negative correlations ("repulsion"). We give an overview starting from definitions.
We discuss algorithms for the private analysis of network data. Such algorithms work on data sets that contain sensitive relationship information (for example, romantic ties).
Abstract: We give an overview of zeros of random polynomials. Starting with results dating back to 1930s (Mark Kac, Offord etc), we intend to cover some of the many recent developments (due to various authors in the past ten years).
Suppose we are given a list of numbers and we wish to determine whether it is sorted in increasing order. That problem obviously requires reading the entire list.
