16404 search results - page 2812 / 3281 » A set coverage problem |
166
click to vote
TCS
1998
15 years 6 months ago
1998
Incomplete relations are relations which contain null values, whose meaning is \value is at present unknown". Such relations give rise to two types of functional dependency (...
163
click to vote
SIAMCO
2002
15 years 6 months ago
2002
The paper introduces a new detectability concept for continuous-time Markov jump linear systems with finite Markov space that generalizes previous concepts found in the literature....
175
click to vote
SIAMDM
2002
15 years 6 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
180
click to vote
TIP
1998
15 years 6 months ago
1998
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
195
click to vote
SIGMETRICS
2002
ACM
15 years 6 months ago
2002
ACM
In this paper we consider the problem of inferring link-level loss rates from end-to-end multicast measurements taken from a collection of trees. We give conditions under which lo...