To track objects in video sequences, many studies have been done to characterize the target with respect to its color distribution. Most often, the Gaussian Mixture Model (GMM) is ...
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
Abstract. Recently, we have proposed a novel approach of texture analysis that has overcome most of the state-of-art methods. This method considers independent walkers, with a give...
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...