1172 search results - page 174 / 235 » Path Algorithms on Regular Graphs |
129
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
ICRA
2010
IEEE
15 years 14 days ago
2010
IEEE
Abstract— Precise calibration of camera intrinsic and extrinsic parameters, while often useful, is difficult to obtain during field operation and presents scaling issues for mu...
133
click to vote
SIGMETRICS
2011
ACM
14 years 4 months ago
2011
ACM
Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifie...
141
click to vote
EMNLP
2011
14 years 1 months ago
2011
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
140
click to vote
WAOA
2005
Springer
15 years 7 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...