We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
In this paper, we tackle the problem of unsupervised selection and posterior recognition of visual landmarks in images sequences acquired by an indoor mobile robot. This is a high...
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
Hema Tahilramani Kaur, Tao Ye, Shivkumar Kalyanara...