We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S, the...
This paper addresses the problem of foreground extraction using active illumination and graph-cut optimization. Our approach starts by detecting image regions that are likely to b...
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...
It is well known that satisfiability of random sets of propositional clauses undergoes phase transition while the clause-to-variable ratio of the sets increases. We introduce anot...
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
Lorenzo Torresani, Vladimir Kolmogorov, Carsten Ro...