This paper proposes a new methodology to schedule activities in projects with stochastic activity durations. The main idea is to determine for each activity an interval in which th...
To detect faces in natural and unconstrained environments, we propose an approach which combines the advantages of both color and gray scale based methods. The idea consists of fi...
We explore the idea of evidence accumulation for combining the results of multiple clusterings. Initially, n d-dimensional data is decomposed into a large number of compact cluste...
The k q-flats algorithm is a generalization of the popular k-means algorithm where q dimensional best fit affine sets replace centroids as the cluster prototypes. In this work, a ...
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...