1998 search results - page 160 / 400 » Complexity of the Cover Polynomial |
167
click to vote
RR
2010
Springer
15 years 4 months ago
2010
Springer
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
145
click to vote
TIT
2010
15 years 1 months ago
2010
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for prac...
172
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Since optimum diversity behavior can be achieved, equalization based on lattice basis reduction is of special interest for transmission over MIMO channels. Although the per-symbol...
153
click to vote
IJHPCA
2006
15 years 6 months ago
2006
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in pol...
172
click to vote
ACTA
1998
15 years 6 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...