Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
Phan Huy Tu, Tran Cao Son, Michael Gelfond, A. Ric...
Geometric rearrangement of images includes operations
such as image retargeting, inpainting, or object rearrangement.
Each such operation can be characterized by a shiftmap:
the...