Sciweavers

3082 search results - page 195 / 617
» New Bounds for the Controller Problem
Sort
View
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
15 years 6 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald
FSTTCS
2008
Springer
15 years 7 months ago
Dynamic matrix rank with partial lookahead
We consider the problem of maintaining information about the rank of a matrix M under changes to its entries. For an n × n matrix M, we show an amortized upper bound of O(nω−1)...
Telikepalli Kavitha
COMPSEC
2002
92views more  COMPSEC 2002»
15 years 6 months ago
A practical key management scheme for access control in a user hierarchy
In a user hierarchy we say that a security class is subordinate to another security class if the former has a lower security privilege than the latter. To implement such a hierarc...
Sheng Zhong
ALT
2009
Springer
16 years 3 months ago
Complexity versus Agreement for Many Views
Abstract. The paper considers the problem of semi-supervised multiview classification, where each view corresponds to a Reproducing Kernel Hilbert Space. An algorithm based on co-...
Odalric-Ambrym Maillard, Nicolas Vayatis
CDC
2008
IEEE
123views Control Systems» more  CDC 2008»
16 years 1 months ago
On distributed averaging algorithms and quantization effects
—We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unqua...
Angelia Nedic, Alexander Olshevsky, Asuman E. Ozda...