2310 search results - page 154 / 462 » Coloring Random Graphs |
143
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
We address the effects of noise in low-light images in this paper. Color images are usually captured by a sensor with a color filter array (CFA). This requires a demosaicing proc...
87
Voted
APAL
2008
15 years 2 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
111
click to vote
CPC
2006
15 years 2 months ago
2006
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
107
click to vote
CORR
2004
Springer
15 years 2 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
102
Voted
COMBINATORICS
1999
15 years 2 months ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...