39 search results - page 7 / 8 » A Structural View on Parameterizing Problems: Distance from ... |
ICALP
2003
Springer
13 years 11 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
ECCV
2004
Springer
14 years 7 months ago
2004
Springer
Classifying materials from their appearance is a challenging problem, especially if illumination and pose conditions are permitted to change: highlights and shadows caused by 3D st...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
VIS
2004
IEEE
14 years 7 months ago
2004
IEEE
Reliable and complete blood-vessel segmentation is still a challenging problem. This is especially true in the presence of morphologic changes resulting from atherosclerotic disea...
ICML
2004
IEEE
14 years 6 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...