2254 search results - page 36 / 451 » Computing the minimal covering set |
TCS
2010
13 years 8 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
ICCSA
2003
Springer
14 years 3 months ago
2003
Springer
A speaker model in speaker recognition system is to be trained from a large data set gathered in multiple sessions. Large data set requires large amount of memory and computation, ...
CVPR
2011
IEEE
13 years 6 months ago
2011
IEEE
The performance of an offline-trained classifier can be improved on-site by adapting the classifier towards newly acquired data. However, the adaptation rate is a tuning parame...
COMGEO
2004
ACM
13 years 9 months ago
2004
ACM
The number of minimum pseudo-triangulations is minimized for point sets in convex position. 2004 Elsevier B.V. All rights reserved.
CORR
2011
Springer
13 years 4 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...