552 search results - page 40 / 111 » Lower bounds for dynamic connectivity |
PERCOM
2006
ACM
14 years 9 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
FS
2010
13 years 8 months ago
2010
We find robust model-free hedges and price bounds for options on the realized variance of [the returns on] an underlying price process. Assuming only that the underlying process ...
ALGORITHMICA
2008
13 years 9 months ago
2008
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain? We look at two differe...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...
UAI
2004
13 years 11 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...