Sciweavers

1930 search results - page 23 / 386
» A Dynamic Graph Algorithm for the Highly Dynamic Network Pro...
Sort
View
PPOPP
1999
ACM
13 years 11 months ago
Automatic Node Selection for High Performance Applications on Networks
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
Jaspal Subhlok, Peter Lieu, Bruce Lowekamp
ICCV
1999
IEEE
14 years 9 months ago
A Dynamic Bayesian Network Approach to Figure Tracking using Learned Dynamic Models
The human figure exhibits complex and rich dynamic behavior that is both nonlinear and time-varying. However, most work on tracking and synthesizing figure motion has employed eit...
Vladimir Pavlovic, James M. Rehg, Tat-Jen Cham, Ke...
WIOPT
2010
IEEE
13 years 5 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
PODC
2010
ACM
13 years 11 months ago
Optimal gradient clock synchronization in dynamic networks
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with...
Fabian Kuhn, Christoph Lenzen, Thomas Locher, Rote...
EUROPAR
2005
Springer
14 years 28 days ago
Dynamic Page Migration Under Brownian Motion
We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where ac...
Marcin Bienkowski, Miroslaw Korzeniowski