Sciweavers

6575 search results - page 982 / 1315
» Specializing visualization algorithms
Sort
View
171
Voted
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
15 years 8 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
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 ...
Shmuel Safra, Oded Schwartz
EDBTW
2010
Springer
15 years 8 months ago
The view update problem for XML
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 ...
Slawek Staworko, Iovka Boneva, Benoît Groz
113
Voted
AINA
2010
IEEE
15 years 8 months ago
Iterative Route Discovery in AODV
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...
Nashid Shahriar, Syed Ashker Ibne Mujib, Arup Rato...
WISE
2002
Springer
15 years 8 months ago
Mining Web Logs for Personalized Site Maps
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...
Fergus Toolan, Nicholas Kushmerick
WISEC
2010
ACM
15 years 8 months ago
Secure walking GPS: a secure localization and key distribution scheme for wireless sensor networks
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...
Qi Mi, John A. Stankovic, Radu Stoleru