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 describe an approach to create a synthetic workload for large scale extensional query answering experiments. The workload comprises multiple interrelated domain ontologies, data...
—This paper proposes a probabilistic technique that enables a node to estimate the number of its neighbors that fulfill certain criteria. The technique does not require any a pr...
Helmut Adam, Evsen Yanmaz, Wilfried Elmenreich, Ch...
We investigate 3-d visibility problems in which the viewing position moves along a straight flightpath. Specifically we focus on two problems: determining the points along the fli...
Marshall W. Bern, David P. Dobkin, David Eppstein,...
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...