Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
We describe a variant of a method used by modern graphic artists to design what are traditionally called Celtic knots, which are part of a larger family of designs called “mirro...
In this paper we present a unsupervised learning based approach for sub-pixel motion estimation. The novelty of this work is the learning based method itself which tries to learn ...
Mithun Das Gupta, Nemanja Petrovic, ShyamSundar Ra...
This paper tackles the problem of accelerating The rest of this paper is organised as follows: section II motion estimation for video processing. A novel architecture details relat...