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...
Touch is an important but poorly studied aspect of emotional communication. With the Haptic Creature we are investigating fundamentals of affective touch. This small robot senses t...
—Embedding small devices into everyday objects like toasters and coffee mugs creates a wireless network of objects. These embedded devices can contain a description of the underl...
We study the characteristics of the communication links of a wireless sensor network in a tropical cloud forest in Ecuador, in the context of a wildlife monitoring application. Thi...
Matteo Ceriotti, Matteo Chini, Amy L. Murphy, Gian...
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...