196 search results - page 28 / 40 » Approximating weighted matchings in parallel |
IPCO
1998
14 years 11 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
ISMIR
2000
Springer
15 years 1 months ago
2000
Springer
We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melod...
104
click to vote
PAMI
2010
14 years 8 months ago
2010
—Many traditional two-view stereo algorithms explicitly or implicitly use the frontal parallel plane assumption when exploiting contextual information since, e.g., the smoothness...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Heterogeneity has been considered in scheduling, but without taking into account the temporal variation of completion times of the sub-tasks for a divisible, independent task. In ...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...