429 search results - page 28 / 86 » Solving the Maximum Clique Problem Using PUBB |
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...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
One of the key problems of restoring a degraded image from motion blur is the estimation of the unknown shiftinvariant linear blur filter. Several algorithms have been proposed ut...
ISBI
2008
IEEE
14 years 8 months ago
2008
IEEE
A new method for estimating multivariate autoregressive (MVAR) models of cortical connectivity from surface EEG or MEG measurements is presented. Conventional approaches to this p...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
UAI
2008
13 years 9 months ago
2008
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...