1930 search results - page 11 / 386 » A Dynamic Graph Algorithm for the Highly Dynamic Network Pro... |
AAAI
2008
13 years 9 months ago
2008
Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distribu...
CHI
2010
ACM
14 years 2 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
SDM
2007
SIAM
13 years 8 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
SUTC
2006
IEEE
14 years 1 months ago
2006
IEEE
We propose and formally characterize a new problem named the dynamic context coverage problem in capabilityconstrained mobile sensor network environments. The goal is to move and ...
IPPS
2003
IEEE
14 years 20 days ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...