Sciweavers

552 search results - page 28 / 111
» Lower bounds for dynamic connectivity
Sort
View
FCT
1997
Springer
15 years 1 months ago
Trade-Off Results for Connection Management
A connection management protocol establishes a connection between two hosts across a wide-area network to allow reliable message delivery. Following previous work of Kleinberg et a...
Marios Mavronicolas, Nikos Papadakis
ALGOSENSORS
2009
Springer
15 years 4 months ago
A Note on Uniform Power Connectivity in the SINR Model
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne ...
TON
2008
109views more  TON 2008»
14 years 9 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 1 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
ASIACRYPT
2001
Springer
15 years 1 months ago
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions
Abstract. We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute ind...
Yuriy Tarannikov, Peter Korolev, Anton Botev