Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
—We present an optimal distributed algorithm to adapt the placement of a single operator in high communication cost networks, such as a wireless sensor network. Our parameterfree...
Given a convex region in the plane, and a sweep-line as a tool, what is best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by ...
Active contours is a popular technique for image segmentation.
However, active contour tend to converge to the
closest local minimum of its energy function and often requires
a ...
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...