830 search results - page 28 / 166 » Generalizing Global Constraints Based on Network Flows |
ICCV
2009
IEEE
15 years 17 days ago
2009
IEEE
In recent years the Markov Random Field (MRF) has
become the de facto probabilistic model for low-level vision
applications. However, in a maximum a posteriori
(MAP) framework, ...
EJWCN
2010
13 years 2 months ago
2010
We present a general game-theoretical framework for the resource allocation problem in the downlink scenario of distributed wireless small-cell networks, where multiple access poi...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
ECAI
2000
Springer
13 years 12 months ago
2000
Springer
Many complex real-world decision problems, such as planning, contain an underlying constraint reasoning problem. The feasibility of a solution candidate then depends on the consis...
COMCOM
2008
13 years 7 months ago
2008
The issue of breaking cycles in communication networks is an important topic for several reasons. For instance, it is required when transparent bridges are filling the forwarding ...