2740 search results - page 71 / 548 » Approximating Component Selection |
JACM
1998
14 years 9 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
115
click to vote
CIARP
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Feature selection has improved the performance of text clustering. In this paper, a local feature selection technique is incorporated in the dynamic hierarchical compact ...
ICTAI
2009
IEEE
14 years 7 months ago
2009
IEEE
The selection of features for classification, clustering and approximation is an important task in pattern recognition, data mining and soft computing. For real-valued features, th...
SIGDIAL
2010
14 years 4 months ago
2010
We perform a study of existing dialogue corpora to establish the theoretical maximum performance of the selection approach to simulating human dialogue behavior in unseen dialogue...
ICCSA
2003
Springer
15 years 3 months ago
2003
Springer
A heuristic method to construct uniform approximations to analytic transcendental functions is developed as a generalization of the Hermite-Pad´e interpolation to infinite interv...