In our experiments with four well-known systems for solving partially observable planning problems (Contingent-FF, MBP, PKS, and POND), we were greatly surprised to find that they...
Ronald Alford, Ugur Kuter, Dana S. Nau, Elnatan Re...
Belief propagation is a popular global optimization technique for many computer vision problems. However, it requires extensive computation due to the iterative message passing op...
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
We present a new color image compression algorithm for RGB images. In our previous work [6], we presented a machine learning technique to derive a dictionary of orthonormal basis ...
We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors...