Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
By sharing data regarding the sensations experienced by individuals, as well as by sharing their knowledge, we are readily able to communicate with each other, and there are possi...
In multi-user networked virtual environments such as Second Life, 3D streaming techniques have been used to progressively download and render 3D objects and terrain, so that a ful...
This paper introduces a distributed haptic control architecture that can render direct interaction between users in addition to cooperative manipulation of virtual objects. The pr...
Computing history has shown that open, multi-layer hardware and software stacks encourage innovation and bring costs down. Only recently this trend is meeting the networking world...
Marcelo Ribeiro Nascimento, Christian Esteve Rothe...