In this work, we propose to improve the neighboring relationship ability of the Hidden Markov Chain (HMC) model, by extending the memory lengthes of both the Markov chain process ...
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
Vijay Gupta, Timothy H. Chung, Babak Hassibi, Rich...
Recommender systems base their operation on past user ratings over a collection of items, for instance, books, CDs, etc. Collaborative filtering (CF) is a successful recommendatio...
Background: Expression array data are used to predict biological functions of uncharacterized genes by comparing their expression profiles to those of characterized genes. While b...