4903 search results - page 278 / 981 » The Set Covering Machine |
229
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
160
click to vote
DCOSS
2009
Springer
16 years 1 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
159
click to vote
APPROX
2004
Springer
16 years 4 days 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, ....
161
click to vote
ICCSA
2003
Springer
15 years 12 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, ...
220
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...