2219 search results - page 232 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
219
click to vote
DC
2011
14 years 3 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...
119
click to vote
SPIN
2007
Springer
15 years 9 months ago
2007
Springer
Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semant...
231
Voted
POPL
2003
ACM
16 years 3 months ago
2003
ACM
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
146
click to vote
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
149
Voted
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...