Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Marco Gori Dipartimento di Ingegneria deU'Informazione Universita di Siena Via Roma 56 53100 Siena, Italy Alessandro Sperduti Dipartimento di Informatica Universita di Pisa C...
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...
- In this paper, we proposed a new solution to the reconstruction of image in order to solve the oversegmentation problem of watershed transformation which is widely used as an ima...
Hyun Sil Sin, Hyun Woo Park, Hwang Kyu Yang, Tae S...
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...
The need to register data is abundant in applications such as: world modeling, part inspection and manufacturing, object recognition, pose estimation, robotic navigation, and reve...
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
Abstract. We introduce a novel implicit approach for single object segmentation in 3D images. The boundary surface of this object is assumed to contain two known curves (the constr...