We address the problem of merging qualitative constraints networks (QCNs). We point out a merging algorithm which computes a consistent QCN representing a global view of the input...
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...
Case-based reasoning (CBR) is a commonly seen problem-solving methodology in artificial intelligence. It can correctly take advantage of the situations and methods in former cases...
Robust tracking of abrupt motion is a challenging task
in computer vision due to the large motion uncertainty. In
this paper, we propose a stochastic approximation Monte
Carlo (...