Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
One of the key factors for the success of recent energy
minimization methods is that they seek to compute global
solutions. Even for non-convex energy functionals, optimization
...
Petter Strandmark, Fredrik Kahl, Niels Chr. Overga...
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tap...
Carsten Rother, Sanjiv Kumar, Vladimir Kolmogorov,...