77 search results - page 6 / 16 » Robust Subgraphs for Trees and Paths |
94
Voted
GD
2009
Springer
15 years 5 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
125
Voted
CN
2007
15 years 12 days ago
2007
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
107
Voted
NETWORKING
2007
15 years 1 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
106
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
106
Voted
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
We propose a more robust robot programming by demonstration system planner that produces a reproduction path which satisfies statistical constraints derived from demonstration traj...