Sciweavers

4114 search results - page 335 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
ICTAI
2009
IEEE
15 years 4 months ago
Merging Qualitative Constraint Networks in a Piecewise Fashion
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...
Jean-François Condotta, Souhila Kaci, Pierr...
JDCTA
2010
151views more  JDCTA 2010»
15 years 1 months ago
Research on Querying Node Probability Method in Probabilistic XML Data Based on Possible World
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...
Jianwei Wang, Zhongxiao Hao
CONSTRAINTS
2002
107views more  CONSTRAINTS 2002»
15 years 6 months ago
Fourier Elimination for Compiling Constraint Hierarchies
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...
Warwick Harvey, Peter J. Stuckey, Alan Borning
ESWA
2002
89views more  ESWA 2002»
15 years 6 months ago
A parallelized indexing method for large-scale case-based reasoning
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...
Wei-Chou Chen, Shian-Shyong Tseng, Lu-Ping Chang, ...
CVPR
2010
IEEE
14 years 3 months ago
Abrupt motion tracking via adaptive stochastic approximation Monte Carlo sampling
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 (...
Xiuzhuang Zhou and Yao Lu