We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
Design of iterative learning control (ILC) often requires some prior knowledge about a system's control matrix. In some applications, such as uncalibrated visual servoing, th...
Knowledge constantly grows in scientific discourse and is revised over time by domain experts. The body of knowledge will get structured and refined as the Communities of Practice...
In this paper, we propose a refinement of TCP Westwood allowing the management of the Efficiency/Friendliness-toNewReno tradeoff. We show that the refined TCP Westwood is able to ...
Ren Wang, Massimo Valla, M. Y. Sanadidi, Bryan K. ...
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...