1092 search results - page 140 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
158
click to vote
PIMRC
2008
IEEE
16 years 20 days ago
2008
IEEE
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
140
click to vote
IPPS
2007
IEEE
16 years 17 days ago
2007
IEEE
Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among ...
175
click to vote
ISAAC
2007
Springer
16 years 12 days ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
142
click to vote
ISSAC
2007
Springer
16 years 12 days ago
2007
Springer
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
176
click to vote
VTC
2006
IEEE
16 years 8 days ago
2006
IEEE
Abstract— This paper proposes a maximum likelihood detection (MLD) method for the differential space-time block code (DSTBC) in cooperation with blind linear prediction (BLP) of ...