10608 search results - page 662 / 2122 » Complexity of O'Hara's Algorithm |
190
click to vote
DATE
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
241
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number ...
177
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
154
click to vote
ICCCN
2007
IEEE
16 years 1 months ago
2007
IEEE
—This paper focuses on the use of specific interleaving techniques for use in W-CDMA (Wideband Code Division Multiple Access). The linear equalization algorithm usually performs ...
213
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...