Sciweavers

51 search results - page 6 / 11
» A case for time-dependent shortest path computation in spati...
Sort
View
ICDE
2009
IEEE
219views Database» more  ICDE 2009»
14 years 9 months ago
Distance Oracles for Spatial Networks
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
Jagan Sankaranarayanan, Hanan Samet
IPPS
2007
IEEE
14 years 1 months ago
Energy-Aware Self-Stabilization in Mobile Ad Hoc Networks: A Multicasting Case Study
Dynamic networks, e.g. Mobile Ad Hoc Networks (MANETs), call for adaptive protocols that can tolerate topological changes due to nodes’ mobility and depletion of battery power. ...
Tridib Mukherjee, Ganesh Sridharan, Sandeep K. S. ...
IDA
2010
Springer
13 years 9 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
HIPC
2007
Springer
13 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
VISUALIZATION
2002
IEEE
14 years 15 days ago
Rendering The First Star In The Universe - A Case Study
For quantitative examination of phenomena that simultaneously occur on very different spatial and temporal scales, adaptive hierarchical schemes are required. A special numerical ...
Ralf Kähler, Donna Cox, Robert Patterson, Stu...