In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
In this paper we describe two methods for estimating the motion parameters of an image sequence. For a sequence of images, the global motion can be described by ???? independent m...
The most popular model used in automatic speech recognition is the hidden Markov model (HMM). Though good performance has been obtained with such models there are well known limit...
This paper describes recent advances in hidden Markov model (HMM) based OCR for machine-printed Arabic documents. A combination of scriptindependent and script-specific techniques...
A dual probability model is constructed for the Latent Semantic Indexing LSI using the cosine similarity measure. Both the document-document similarity matrix and the term-term ...