1404 search results - page 101 / 281 » Optimization problems in multiple-interval graphs |
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
105
click to vote
HICSS
2003
IEEE
15 years 3 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...