6045 search results - page 68 / 1209 » Computable Linearizations of Well-partial-orderings |
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
We propose an efficient method, built on the popular Bag
of Features approach, that obtains robust multiclass pixellevel
object segmentation of an image in less than 500ms,
with...
FOCS
2002
IEEE
14 years 25 days ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
JMLR
2010
13 years 6 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
PR
2011
13 years 2 months ago
2011
Non-blind motion deblurring problems are highly ill-posed and so it is quite difficult to find the original sharp and clean image. To handle ill-posedness of the motion deblurrin...
CVPR
1998
IEEE
14 years 10 months ago
1998
IEEE
We introduce a unified framework for developing matching constraints of multiple affine views and rederive 2-view (affine epipolar geometry) and 3-view (affine image transfer) con...