A covering array CA(N; t, k, v) is an N ? k array such that every N ? t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Coverin...
Charles J. Colbourn, Sosina Martirosyan, Tran van ...
This paper examines technique of media access that flexible media service, provided user interaction, and guaranteeing QoS. Currently, there are various streaming services, but th...
Sangok Kim, Kanghee Lee, Zhefan Jiang, Sangwook Ki...
We present Place Storming, an original method of brainstorming technological concepts, particularly in the area of pervasive computing. Place Storming is contextdriven and play-ba...
While mechanical cloth simulation systems are widely used for creating draped garments on virtual characters, the animation of virtual garments raise challenges on its own. The pe...
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...