2496 search results - page 189 / 500 » On covering by translates of a set |
159
click to vote
APPROX
2004
Springer
15 years 12 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
156
click to vote
ICCSA
2003
Springer
15 years 11 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, ...
217
click to vote
ICLP
1994
Springer
15 years 10 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
182
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
155
click to vote
ISDA
2009
IEEE
16 years 1 months ago
2009
IEEE
—The present work is focused on the improvement of a Sensing Seat system previously developed by the authors for the initial authentication purpose in office and car scenarios. ...