4894 search results - page 552 / 979 » The Guarding Problem - Complexity and Approximation |
131
Voted
SODA
2010
ACM
16 years 2 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
134
click to vote
CVPR
2010
IEEE
16 years 17 days ago
2010
IEEE
We introduce locally-rigid motion, a general framework for solving the M-point, N-view structure-from-motion problem for unknown bodies deforming under orthography. The key idea i...
142
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Coordination of multiple agents under uncertainty in the decentralized POMDP model is known to be NEXP-complete, even when the agents have a joint set of goals. Nevertheless, we s...
143
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
— Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backb...
122
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we investigate the fault diagnosis problem in IP networks. We provide a lower bound on the average number of probes per edge using variational inference technique pro...