2310 search results - page 167 / 462 » Coloring Random Graphs |
128
Voted
INCDM
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Clustering algorithms for multidimensional numerical data must overcome special difficulties due to the irregularities of data distribution. We present a clustering algo...
123
Voted
GD
2006
Springer
15 years 6 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
145
Voted
WWW
2010
ACM
15 years 9 months ago
2010
ACM
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
136
click to vote
ICMCS
2010
IEEE
15 years 3 months ago
2010
IEEE
In this paper, we propose an unsupervised segmentation algorithm for extracting moving objects/regions from compressed video using Markov Random Field (MRF) classification. First,...
98
Voted
RSA
1998
15 years 2 months ago
1998
We introduce some generalizations of a nice combinatorial problem, the central notion of which is the so-called Disease Process. Let us color independently each square of an n×n c...