A plan with rich control structures like branches and loops can usually serve as a general solution that solves multiple planning instances in a domain. However, the correctness o...
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
In this paper, we complete the construction of paper [9, 11]. Together with the proof contained in [9, 11], this paper definitely proves that the general problem of tiling the hy...
— Consider the two-terminal partial side information problem, where one source is decoded under a distortion measure, while the other acts as a helper. There are two well known i...
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...