: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm th...
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
Abstract-- Learning by imitation and learning from demonstration have received considerable attention in robotics. However, very little research has been in the direction of provid...
We present a method for unsupervised learning of event classes from videos in which multiple actions might occur simultaneously. It is assumed that all such activities are produce...
Muralikrishna Sridhar, Anthony G. Cohn, David C. H...