4451 search results - page 51 / 891 » On Random Ordering Constraints |
103
click to vote
PAMI
2010
14 years 10 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
117
click to vote
TSP
2010
14 years 6 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
130
click to vote
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
In this paper, we propose a unified graphical-model framework to interpret a scene composed of multiple objects in monocular video sequences. Using a single pairwise Markov random...
JSAC
2007
14 years 11 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
107
click to vote
CSL
2010
Springer
15 years 28 days ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...