1145 search results - page 167 / 229 » Discrete Green's Functions |
169
click to vote
PAMI
2007
15 years 5 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
177
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
163
click to vote
MICCAI
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we propose a Markov random field (MRF) based method for joint registration and segmentation of cardiac perfusion images, specifically the left ventricle (LV). MRFs ...
149
click to vote
TCS
2010
15 years 4 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
201
click to vote
MP
2011
15 years 17 days ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...