An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
Based on a revision of the common task understanding in model-based approaches a formal meta model is proposed which allows more expressive task descriptions. A task is considered ...
We study the Boolean functions f :F2n F2, n = 6r, of the form f (x) = Tr(xd) with d = 22r + 2r + 1 and F2n . Our main result is the characterization of those for which f are b...
Anne Canteaut, Pascale Charpin, Gohar M. M. Kyureg...
This letter derives the asymptotic symbol error rate (SER) and outage probability of multiple-input multiple-output (MIMO) maximum ratio-combining (MRC) systems. We consider Raylei...
Shi Jin, Matthew R. McKay, Xiqi Gao, Iain B. Colli...