In this paper, a statistical clustering model and algorithm have been discussed. Finding the optimal solution to clustering problem is transformed into simulating the equilibrium ...
A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is dened as the maximum a posteriori (MAP) probability estimate...
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a...
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...