Sciweavers

552 search results - page 65 / 111
» Lower bounds for dynamic connectivity
Sort
View
CIDU
2010
13 years 6 months ago
Optimal Partitions of Data In Higher Dimensions
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
Bradley W. Jackson, Jeffrey D. Scargle, Chris Cusa...
IPL
2006
141views more  IPL 2006»
13 years 9 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan
INFOCOM
2003
IEEE
14 years 2 months ago
An information theoretic view of network management
—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we desc...
Tracey Ho, Muriel Médard, Ralf Koetter
INFOCOM
2000
IEEE
14 years 1 months ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
NETWORKING
2007
13 years 10 months ago
Graph Based Modeling of P2P Streaming Systems
This paper addresses the study of fundamental properties of stream-based content distribution services. We assume the presence of an overlay network with limited connectivity degre...
Damiano Carra, Renato Lo Cigno, Ernst W. Biersack