Sciweavers

3422 search results - page 28 / 685
» Random Subset Optimization
Sort
View
ICITS
2009
14 years 11 months ago
Linear Threshold Multisecret Sharing Schemes
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here un...
Oriol Farràs, Ignacio Gracia, Sebasti&agrav...
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
15 years 7 months ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek
RSA
2010
89views more  RSA 2010»
15 years 9 days ago
Ramsey properties of random discrete structures
We study thresholds for Ramsey properties of random discrete structures. In particular, we determine the threshold for Rado’s theorem for solutions of partition regular systems o...
Ehud Friedgut, Vojtech Rödl, Mathias Schacht
CORR
2007
Springer
146views Education» more  CORR 2007»
15 years 1 months ago
Coding for Errors and Erasures in Random Network Coding
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
Ralf Koetter, Frank R. Kschischang
COMBINATORICA
2008
123views more  COMBINATORICA 2008»
15 years 15 days ago
Counting canonical partitions in the random graph
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
Jean A. Larson