Sciweavers

268 search results - page 24 / 54
» Facility location: distributed approximation
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Distributed Navigation Algorithms for Sensor Networks
— We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations ...
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash ...
AINA
2009
IEEE
13 years 5 months ago
Approximating Travel Times Using Opportunistic Networking
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...
Rudi Ball, Naranker Dulay
WCNC
2008
IEEE
14 years 2 months ago
On the Distribution of Positioning Errors in Wireless Sensor Networks: A Simulative Comparison of Optimization Algorithms
Abstract—Recent advances in the technology of wireless electronic devices have made possible to build ad–hoc Wireless Sensor Networks (WSNs) using inexpensive nodes consisting ...
Stefano Tennina, Marco Di Renzo, Fortunato Santucc...
FOCS
2007
IEEE
14 years 2 months ago
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
Uriel Feige, Vahab S. Mirrokni, Jan Vondrák
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
14 years 8 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar