We study discrete Green's functions and their relationship with discrete Laplace equations. Several methods for deriving Green's functions are discussed. Green's fu...
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...