Sciweavers

658 search results - page 89 / 132
» Lower bounds for sorting networks
Sort
View
WWW
2006
ACM
14 years 8 months ago
Semantic link based top-K join queries in P2P networks
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
Jie Liu, Liang Feng, Chao He
INFOCOM
2009
IEEE
14 years 2 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 2 months ago
Three Results on Frequency Assignment in Linear Cellular Networks
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
Marek Chrobak, Jiri Sgall
GLOBECOM
2008
IEEE
14 years 2 months ago
Interference Reduction by Beamforming in Cognitive Networks
— We consider beamforming in a cognitive network with multiple primary users and secondary users sharing the same spectrum. In particular, we assume that each secondary transmitt...
Simon Yiu, Mai Vu, Vahid Tarokh
VTC
2008
IEEE
153views Communications» more  VTC 2008»
14 years 2 months ago
Analytical Model for Message Propagation in Delay Tolerant Vehicular Ad Hoc Networks
–In this paper we present an analytical model for delay tolerant message propagation in a dynamic vehicular network. The analysis provides upper and lower bounds for message prop...
Ashish Agarwal, David Starobinski, Thomas D. C. Li...