1477 search results - page 109 / 296 » Complexity of (iterated) dominance |
150
click to vote
ADHOCNETS
2009
Springer
16 years 1 months ago
2009
Springer
Self-organisation has emerged as a very promising approach to the design, deployment, operation, control and evolution of complex wireless networks. The dominant strictly layered d...
160
click to vote
DATE
2007
IEEE
16 years 22 days 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 ...
179
click to vote
CC
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
157
click to vote
ICA
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. This paper deals with the problem of estimating atrial activity during atrial fibrillation periods in the electrocardiogram (ECG). Since the signal of interest differs ...
164
click to vote
KBSE
2006
IEEE
16 years 12 days ago
2006
IEEE
Traditional design representations are inadequate for generalized reasoning about modularity in design and its technical and economic implications. We have developed an architectu...