1208 search results - page 71 / 242 » On Counting Generalized Colorings |
MVA
2008
13 years 9 months ago
2008
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 ...
NETWORKS
2010
13 years 7 months ago
2010
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, . . . ...
CIARP
2010
Springer
13 years 4 months ago
2010
Springer
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...
ICALP
2011
Springer
13 years 18 days ago
2011
Springer
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...
RSA
2008
13 years 8 months ago
2008
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, ...