196 search results - page 6 / 40 » Approximating weighted matchings in parallel |
60
Voted
BIRTHDAY
2010
Springer
14 years 11 months ago
2010
Springer
SSDBM
2007
IEEE
15 years 3 months ago
2007
IEEE
As relational database management systems are applied to non-traditional domains such as scientific data management, there is an increasing need to support queries with semantics ...
112
click to vote
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
101
click to vote
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we formulate an algorithm for the stereo matching problem with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matchin...