Sciweavers

266 search results - page 34 / 54
» On first-order topological queries
Sort
View
CCCG
2010
13 years 9 months ago
Connected dominating sets on dynamic geometric graphs
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...
EON
2007
13 years 9 months ago
Benchmarking Reasoners for Multi-Ontology Applications
We describe an approach to create a synthetic workload for large scale extensional query answering experiments. The workload comprises multiple interrelated domain ontologies, data...
Ameet Chitnis, Abir Qasem, Jeff Heflin
VTC
2010
IEEE
107views Communications» more  VTC 2010»
13 years 6 months ago
Contention-Based Neighborhood Estimation
—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...
SODA
1990
ACM
82views Algorithms» more  SODA 1990»
13 years 8 months ago
Visibility with a Moving Point of View
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,...
SENSYS
2003
ACM
14 years 26 days ago
GEM: graph eMbedding for routing and data-centric storage in sensor networks without geographic information
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...
James Newsome, Dawn Xiaodong Song