We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
We study the problem of update propagation across views in the setting where both the view and the source database are XML documents. We consider a simple class of XML views that ...
Abstract—Several protocols for ad hoc network try to reduce redundancy as an effective measure against broadcast problems. Though these protocols ensure good performance in a fav...
Navigating through a large Web site can be a frustrating exercise. Many sites employ Site Maps to help visitors understand the overall structure of the site. However, by their ver...
In many applications of wireless sensor networks, sensor nodes are manually deployed in hostile environments where an attacker can disrupt the localization service and tamper with...