3591 search results - page 293 / 719 » Typing linear constraints |
298
click to vote
DC
2011
14 years 7 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
217
click to vote
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
Motion blur retains some information about motion, based on which motion may be recovered from blurred images. This is a difficult problem, as the situations of motion blur can be...
196
click to vote
ECCV
2006
Springer
16 years 9 months ago
2006
Springer
We consider the problem of nonrigid shape and motion recovery from point correspondences in multiple perspective views. It is well known that the constraints among multiple views o...
203
click to vote
ICML
2008
IEEE
16 years 8 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
231
click to vote
PODC
2009
ACM
16 years 8 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...