Sciweavers

144 search results - page 26 / 29
» Constraint Propagation in Graph Coloring
Sort
View
ATAL
2005
Springer
14 years 1 months ago
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
Syed Muhammad Ali, Sven Koenig, Milind Tambe
CVPR
2010
IEEE
14 years 3 months ago
Efficient Piecewise Learning for Conditional Random Fields
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
Karteek Alahari, Phil Torr
ICC
2008
IEEE
153views Communications» more  ICC 2008»
14 years 1 months ago
MARIA: Interference-Aware Admission Control and QoS Routing in Wireless Mesh Networks
Abstract— Interference among concurrent transmissions complicates QoS provisioning for multimedia applications in wireless mesh networks. In this paper we propose MARIA (Mesh Adm...
Xiaolin Cheng, Prasant Mohapatra, Sung-Ju Lee, Suj...
IWCM
2004
Springer
14 years 26 days ago
Tracking Complex Objects Using Graphical Object Models
We present a probabilistic framework for component-based automatic detection and tracking of objects in video. We represent objects as spatio-temporal two-layer graphical models, w...
Leonid Sigal, Ying Zhu, Dorin Comaniciu, Michael J...
IJCAI
2007
13 years 9 months ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings