Sciweavers

3415 search results - page 594 / 683
» Lower Bounds for Kernelizations
Sort
View
RSA
2010
99views more  RSA 2010»
13 years 8 months ago
Hamiltonicity thresholds in Achlioptas processes
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
Michael Krivelevich, Eyal Lubetzky, Benny Sudakov
SETA
2010
Springer
173views Mathematics» more  SETA 2010»
13 years 8 months ago
User-Irrepressible Sequences
Protocol sequences are binary and periodic sequences used in multiple-access scheme for collision channel without feedback. Each user reads out the bits from the assigned protocol ...
Kenneth W. Shum, Yijin Zhang, Wing Shing Wong
SIAMDM
2010
128views more  SIAMDM 2010»
13 years 8 months ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...
TCOM
2010
220views more  TCOM 2010»
13 years 8 months ago
Fiber fault PON monitoring using optical coding: Effects of customer geographic distribution
Abstract—We analyze the performance of fiber fault monitoring of a PON using a centralized, passive optical coding (OC) system. We develop an expression for the detected monitor...
Mohammad M. Rad, Habib Fathallah, Leslie A. Rusch
LCN
2008
IEEE
14 years 4 months ago
Speedo: Realistic achievable bandwidth in 802.11 through passive monitoring
—End to end available bandwidth is often constrained by IEEE 802.11 hops in the access network. Available bandwidth measurement is particularly challenging in the wireless enviro...
Malik Ahmad Yar Khan, Darryl Veitch