1272 search results - page 206 / 255 » Approximate Parameterized Matching |
128
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
127
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
We present a novel keyframe selection and recognition
method for robust markerless real-time camera tracking.
Our system contains an ofine module to select features
from a grou...
123
Voted
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
We construct a Bayesian model that integrates topdown with bottom-up criteria, capitalizing on their relative merits to obtain figure-ground segmentation that is shape-specific an...
147
click to vote
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
151
click to vote
ICCV
2001
IEEE
16 years 5 months ago
2001
IEEE
We prove that the set of all Lambertian reflectance functions (the mapping from surface normals to intensities) obtained with arbitrary distant light sources lies close to a 9D lin...