3598 search results - page 9 / 720 » New efficient algorithms for computing effective capacitance |
INFORMS
2008
13 years 8 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
ICPADS
2006
IEEE
14 years 2 months ago
2006
IEEE
Efficient task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (or HeDCSs). Because of its key importance, several scheduling...
DISOPT
2008
13 years 8 months ago
2008
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper, we propose an online interactive matting algorithm, which we call FuzzyMatte. Our framework is based on computing the fuzzy connectedness (FC) [20] from each unknow...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
This paper develops an efficient new method for 3D partial shape retrieval. First, a Monte Carlo sampling strategy is employed to extract local shape signatures from each 3D model...