Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
In this paper we study a parallel algorithm for computing the singular value decomposition (SVD) of a product of two matrices on message passing multiprocessors. This algorithm is ...
Probabilistic Latent Semantic Indexing is a novel approach to automated document indexing which is based on a statistical latent class model for factor analysis of count data. Fit...
— We introduce in this paper methods for finding mutually corresponding dependent components from two different but related data sets in an unsupervised (blind) manner. The basi...