4298 search results - page 38 / 860 » Measurable chromatic numbers |
ICMCS
2007
IEEE
13 years 10 months ago
2007
IEEE
This paper presents a new two-stage approach to impulse noise removal for color image. The first step is the impulse detection, in which the so-called Rank-Ordered Absolute Diffe...
ICMCS
2009
IEEE
13 years 7 months ago
2009
IEEE
Automatic labeling of chords in original audio recordings is challenging due to heavy acoustic overlay by melody and percussion sections, detuning and arpeggios that demand for a ...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
COMBINATORICA
2008
13 years 10 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
COMBINATORICS
2007
13 years 9 months ago
2007
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...