We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
Towards the goal of realizing a generic automatichuman activity recognition system, a new formalism is proposed. Activities are described by a chained hierarchical representation ...
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
David B. Chandler, Jiong Guo, Ton Kloks, Rolf Nied...
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
Roland Bader, Jonathan Dees, Robert Geisberger, Pe...