Sciweavers

79 search results - page 13 / 16
» Shortest path in a polygon using sublinear space
Sort
View
TKDE
2010
195views more  TKDE 2010»
15 years 2 months ago
Query Processing Using 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 findin...
Jagan Sankaranarayanan, Hanan Samet
100
Voted
JEA
2006
83views more  JEA 2006»
15 years 3 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna
136
Voted
ICNP
2006
IEEE
15 years 10 months ago
Orthogonal Rendezvous Routing Protocol for Wireless Mesh Networks
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
CORR
2007
Springer
111views Education» more  CORR 2007»
15 years 3 months ago
Capacity of Sparse Multipath Channels in the Ultra-Wideband Regime
—This paper studies the ergodic capacity of time- and frequency-selective multipath fading channels in the ultrawideband (UWB) regime when training signals are used for channel e...
Vasanthan Raghavan, Gautham Hariharan, Akbar M. Sa...
PVLDB
2010
152views more  PVLDB 2010»
15 years 2 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...