Sciweavers

4865 search results - page 274 / 973
» The Complexity of Graph Connectivity
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 10 months ago
Percolation in the Secrecy Graph
— Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely ...
Amites Sarkar, Martin Haenggi
ICDE
2009
IEEE
184views Database» more  ICDE 2009»
16 years 1 months ago
Scalable Keyword Search on Large Data Streams
Abstract— It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new ...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao
ICNP
2006
IEEE
16 years 20 days 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...
SSDBM
2006
IEEE
156views Database» more  SSDBM 2006»
16 years 19 days ago
On Data and Visualization Models for Signaling Pathways
Signaling pathways are chains of interacting proteins, through which the cell converts a (usually) extracellular signal into a biological response. The number of known signaling p...
Nattakarn Ratprasartporn, Ali Cakmak, Gultekin &Ou...
MOBICOM
2003
ACM
15 years 12 months ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas