Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
In this paper, a new recursive algorithm is proposed for optimal estimation of similarity measure used in a content-based retrieval system. This is performed through a relevance f...
We present a new fast method of modeling 3-D objects of arbitrary topology. The Level Set Methods have been used by many researchers to recover 3-D shapes of arbitrary topology. H...
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...