7129 search results - page 1190 / 1426 » Approximation Algorithms for Treewidth |
108
click to vote
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
150
click to vote
TACAS
2007
Springer
15 years 9 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
156
click to vote
WADS
2007
Springer
15 years 9 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
144
click to vote
LCN
2006
IEEE
15 years 9 months ago
2006
IEEE
To support reliable multicast routing in wireless mesh networks, it is important to protect multicast sessions against link or node failures. The issue of protecting multicast ses...
123
click to vote
ACIVS
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We present an algorithm for interpolating the visible portions of a point cloud that are sampled from opaque objects in the environment. Our algorithm projects point clou...