Sciweavers

IWCMC
2009
ACM
13 years 10 months ago
Energy penalties for non-shortest paths in wireless sensor networks with link failures
This paper addresses the additional energy consumption in wireless sensor networks where the communication between the sensor nodes and the sink nodes does not always make use of ...
Geir Egeland, Paal E. Engelstad
WADS
2009
Springer
317views Algorithms» more  WADS 2009»
13 years 11 months ago
Shortest Path Problems on a Polyhedral Surface
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface a...
Atlas F. Cook, Carola Wenk
AAIM
2009
Springer
119views Algorithms» more  AAIM 2009»
13 years 11 months ago
Link Distance and Shortest Path Problems in the Plane
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
Atlas F. Cook, Carola Wenk
WEA
2010
Springer
344views Algorithms» more  WEA 2010»
13 years 11 months ago
Alternative Routes in Road Networks
We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are ...
Ittai Abraham, Daniel Delling, Andrew V. Goldberg,...
SDM
2009
SIAM
331views Data Mining» more  SDM 2009»
14 years 1 months ago
Privacy Preservation in Social Networks with Sensitive Edge Weights.
With the development of emerging social networks, such as Facebook and MySpace, security and privacy threats arising from social network analysis bring a risk of disclosure of con...
Jie Wang, Jinze Liu, Jun Zhang, Lian Liu
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 1 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
ICDE
2010
IEEE
247views Database» more  ICDE 2010»
14 years 4 months ago
Efficient Verification of Shortest Path Search via Authenticated Hints
Shortest path search in transportation networks is unarguably one of the most important online search services nowadays (e.g., Google Maps, MapQuest, etc), with applications spanni...
Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 4 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
ICDE
2009
IEEE
149views Database» more  ICDE 2009»
14 years 6 months ago
OPAQUE: Protecting Path Privacy in Directions Search
Directions search returns the shortest path from a source to a destination on a road network. However, the search interests of users may be exposed to the service providers, thus r...
Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Baih...

Publication
2630views
15 years 3 months ago
DIJKSTRA’S and Fast Marching Method for Optimal Path Planning
This technical report illustrates the differences in solving the optimal path problem (shortest path) using different methods, where the underlying PDE can be described by the eik...
RYO TAKEI