552 search results - page 60 / 111 » Lower bounds for dynamic connectivity |
JVM
2004
13 years 11 months ago
2004
Virtual machines can greatly simplify wide-area discomputing by lowering the level of abstraction to the benefit of both resource providers and users. Networking, however, can be ...
CISS
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract— We consider the linear minimum meansquared error (LMMSE) estimation of a random vector of interest from its fusion frame measurements in presence noise and subspace era...
JGAA
2006
13 years 9 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
COMBINATORICA
2007
13 years 9 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
CIMCA
2008
IEEE
14 years 4 months ago
2008
IEEE
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...