4302 search results - page 252 / 861 » Index Pairs Algorithms |
117
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
130
Voted
FUN
2007
Springer
15 years 10 months ago
2007
Springer
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
159
click to vote
ROBIO
2006
IEEE
15 years 10 months ago
2006
IEEE
– In this paper, we present a cooperative stereo vision algorithm with three cameras for dense disparity mapping and occlusion detection. Based on nonlinear iteration and multipl...
106
click to vote
ACL
2006
15 years 5 months ago
2006
In this paper, we will present an efficient method to compute the co-occurrence counts of any pair of substring in a parallel corpus, and an algorithm that make use of these count...
150
click to vote
ISCI
2008
15 years 3 months ago
2008
This work develops a novel general routing algorithm, which is a routing function, for constructing a container of width n1 between any pair of vertices in an (n, k)-star graph wi...