428 search results - page 39 / 86 » Completeness of a Fact Extractor |
108
click to vote
APPROX
2000
Springer
15 years 4 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
EJC
2008
14 years 12 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
107
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the node...
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
Occlusion is a difficult problem for appearance-based target tracking, especially when we need to track multiple targets simultaneously and maintain the target identities during t...
102
click to vote
ICIP
2006
IEEE
16 years 1 months ago
2006
IEEE
We propose an efficient multiscale image disparity estimation algorithm that estimates the local translations needed to align different regions in two images. The algorithm is bas...