650 search results - page 71 / 130 » Positive graphs |
DISOPT
2008
13 years 10 months ago
2008
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
JCO
2008
13 years 10 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
CDC
2010
IEEE
13 years 5 months ago
2010
IEEE
We study the problem of distributed control of a large network of double-integrator agents to maintain a rigid formation. A few lead vehicles are given information on the desired t...
CAIP
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Tracking of articulated objects is a challenging task in Computer Vision. A highly target specific model can improve the robustness of the tracking by eliminating or red...