79 search results - page 6 / 16 » Linear programming bounds for unitary space time codes |
102
click to vote
JCSS
2000
14 years 9 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...
STOC
1998
ACM
15 years 1 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
SPAA
2010
ACM
15 years 1 months ago
2010
ACM
In dynamically multithreaded platforms that employ work stealing, there appears to be a fundamental tradeoff between providing provably good time and space bounds and supporting S...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...