Sciweavers

69 search results - page 11 / 14
» Guaranteeing Practical Convergence in Algorithms for Sensor ...
Sort
View
TWC
2008
135views more  TWC 2008»
13 years 7 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
CIKM
2007
Springer
14 years 1 months ago
Query expansion using probabilistic local feedback with application to multimedia retrieval
As one of the most effective query expansion approaches, local feedback is able to automatically discover new query terms and improve retrieval accuracy for different retrieval ...
Rong Yan, Alexander G. Hauptmann
CN
2006
74views more  CN 2006»
13 years 7 months ago
Measurement-based optimal routing on overlay architectures for unicast sessions
We propose a measurement-based routing algorithm to load-balance intradomain traffic along multiple paths for multiple unicast sources. Multiple paths are established using overla...
Tuna Güven, Richard J. La, Mark A. Shayman, B...
MOBICOM
2005
ACM
14 years 1 months ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
DCOSS
2006
Springer
13 years 11 months ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...