A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
: Current and future SoC designs will contain an increasing number of programmable units. To be able to tailor and debug these processors in their system context at the highest pos...
Andreas Wieferink, Tim Kogel, Olaf Zerres, Rainer ...
In this paper, a multiple-input-multiple-output (MIMO) hybrid-automatic repeat request (HARQ) algorithm with antenna scheduling is proposed. It retransmits the packet using schedu...
KyooHyun Kim, SeungWon Kang, Manar Mohaisen, Kyung...
The model of bulk-synchronous parallel computation (BSP) helps to implement portable general purpose algorithms while keeping predictable performance on different parallel compute...
Government-endorsed security evaluations, like those performed under the Common Criteria (CC), use established techniques of software quality assurance to try to evaluate product ...