Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2 time, Omn space algorithm to nd portions of the text" T which are similar in sh...