2754 search results - page 89 / 551 » Distributed Weighted Matching |
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
NIPS
2007
14 years 11 days ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
ICDCS
2011
IEEE
12 years 10 months ago
2011
IEEE
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...
ICIP
2007
IEEE
15 years 19 days ago
2007
IEEE
Recently, `entry/exit' events of objects in the field-of-views of cameras were used to learn the topology of the camera network. The integration of object appearance was also...
MOBICOM
2000
ACM
14 years 3 months ago
2000
ACM
—Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate bandwidth in proportion to weights of the packet flows ...