We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP...
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
Marco F. Duarte, Michael B. Wakin, Richard G. Bara...
In this paper pseudo 3-D Hidden Markov Models (P3DHMMs) are applied to the task of dynamic facial expression recognition. P3DHMMs are an extension of the pseudo 2-D case, which ha...
Protein fold recognition has been the focus of computational biologists for many years. In order to map a protein primary structure to its correct 3D fold, we introduce in this pa...