659 search results - page 35 / 132 » Dynamic Algorithms for Graph Spanners |
TCSV
2008
13 years 7 months ago
2008
Object tracking is one of the fundamental problems in computer vision and has received considerable attention in the past two decades. The success of a tracking algorithm relies on...
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...
COCOON
2001
Springer
14 years 1 days ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...