Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Rapidly simulating global illumination, including diffuse and glossy light transport is a very difficult problem. Finite element or radiosity approaches can achieve interactive si...
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Image retrieval critically relies on the distance function used to compare a query image to images in the database. We suggest to learn such distance functions by training binary ...
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...