The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
This paper presents a non-local kernel regression (NL-KR) method for image and video restoration tasks, which exploits both the non-local self-similarity and local structural regul...
Abstract. The application of kernel methods to link analysis is explored. We argue that a family of kernels on graphs provides a unified perspective on the three measures proposed ...