31 search results - page 5 / 7 » An Efficient Algorithm for Solving Pseudo Clique Enumeration... |
ICPR
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
SETN
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a robust, automated registration algorithm, which may be applied to several types of medical images, including CTs, MRIs, Xrays, Ultrasounds and dermatological ...
JDCTA
2010
13 years 2 months ago
2010
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...
RSP
1998
IEEE
13 years 12 months ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
CPAIOR
2006
Springer
13 years 9 months ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...