We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
Leonidas J. Guibas, Nikola Milosavljevic, Arik Mot...
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
In this paper, we show that we can improve accuracies of 3-D reconstructions with uncalibrated stereo by classifying correspondences between two images. After obtaining initial co...
We consider a pair of nodes with stochastic traffic flows who wish to communicate in a bi-directional communication scenario using intermediate relays in two-hop fashion. Intermed...
Most foreign names are transliterated into Chinese, Japanese or Korean with approximate phonetic equivalents. The transliteration is usually achieved through intermediate phonemic...