Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
Abstract--We present a new technique for audio signal comparison based on tonal subsequence alignment and its application to detect cover versions (i.e., different performances of ...