We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
We focus on the class of regular models defined by Várady et al. for reverse engineering purposes. Given a 3D surface M represented through a dense set of points, we present a n...
Abstract. An automated method of general purpose is introduced for computing a rigorous estimate of a bounded region in Rn whose points satisfy a given property. The method is base...
Abstract—We consider a cognitive radio network where multiple secondary users (SUs) contend for spectrum usage, using random access, over available primary user (PU) channels. Ou...
Boundary recognition is an important and challenging issue in wireless sensor networks when no coordinates or distances are available. The distinction between inner and boundary n...
Olga Saukh, Robert Sauter, Matthias Gauger, Pedro ...