In this paper we present a new surface reconstruction technique for piecewise smooth surfaces from point clouds, such as scans of architectural sites or man-made artifacts. The te...
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan