106 search results - page 16 / 22 » A randomized on-line algorithm for the k-server problem on a... |
SPAA
1990
ACM
13 years 11 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
FSTTCS
2004
Springer
14 years 26 days ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
In this paper, we formulate the stereo matching problem as a Markov network consisting of three coupled Markov random fields (MRF's). These three MRF's model a smooth fie...
MFCS
2001
Springer
13 years 12 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...