In functional connectivity analysis, networks of interest are defined based on correlation with the mean time course of a user-selected `seed' region. In this work we propose ...
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
—This paper presents an efficient protocol to reliably exchange information in a single-hop radio network with unpredictable interference. The devices can access C communication...
Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalsk...
Dealing with static and dynamic parameter variations has become a major challenge for design and test. To avoid unnecessary yield loss and to ensure reliable system operation a ro...
Uranmandakh Amgalan, Christian Hachmann, Sybille H...
Cost effective SOC test strongly hinges on parallel, independent test of SOC cores, which can only be ensured through proper core isolation techniques. While a core isolation mech...