Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
Abstract. Natural images consist of texture, structure and smooth regions and this makes the task of filtering challenging mainly when it aims at edge and texture preservation. In...
We investigate several techniques that partition a crowded virtual environment into regions that can be managed by separate servers or mapped onto different multicast groups. When...
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
We present a new method for automatically filling in gaps of textural sounds. Our approach is to transform the signal to the time-frequency space, fill in the gap, and apply the i...