1089 search results - page 103 / 218 » Bounds on generalized Frobenius numbers |
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
COMBINATORICS
1998
13 years 8 months ago
1998
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
CORR
2009
Springer
13 years 6 months ago
2009
Springer
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
INFOCOM
2003
IEEE
14 years 2 months ago
2003
IEEE
—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...