1299 search results - page 206 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
WINE
2005
Springer
15 years 3 months ago
2005
Springer
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
In this paper we aim at reconstructing 3D scenes from images
with unknown focal lengths downloaded from photosharing
websites such as Flickr. First we provide a minimal
solution...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a new shape prior segmentation method using graph cuts capable of segmenting multiple objects. The shape prior energy is based on a shape distance popular with level se...
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...