557 search results - page 51 / 112 » On the convergence time of distributed quantized averaging a... |
ICPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We present the Higher Order Proxy Neighborhoods (HOPS) approach to modeling higher order neighborhoods in Markov Random Fields (MRFs). HOPS incorporates more context information i...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
SC
2003
ACM
14 years 1 months ago
2003
ACM
We report on a model of the distribution of job submission interarrival times in supercomputers. Interarrival times are modeled as a consequence of a complicated set of decisions ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—In this paper, we present a distributed algorithm to dynamically allocate the available resources of a service-oriented network to delay sensitive network services. We use a uti...