1429 search results - page 89 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
We pose the problem of tracing traitors, who have colluded to circumvent a multimedia fingerprinting system, as a sparse underdetermined linear problem. We propose a range of det...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
AIPS
2007
13 years 11 months ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
ACTA
1998
13 years 9 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
ECML
1993
Springer
14 years 1 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...