1092 search results - page 61 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
173
click to vote
GLOBECOM
2007
IEEE
16 years 5 days ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
180
click to vote
FCT
2005
Springer
15 years 11 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
148
click to vote
TAMC
2009
Springer
16 years 11 days ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
158
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
169
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to f...