This paper presents a probabilistic grammar approach to the recognition of complex events in videos. Firstly, based on the original motion features, a rule induction algorithm is a...
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...