2310 search results - page 256 / 462 » Coloring Random Graphs |
INFOCOM
2011
IEEE
12 years 12 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
DM
2000
13 years 8 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Information security has become a cause of concern because of the electronic eavesdropping. Capacity, robustness and invisibility are important parameters in information hiding and...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
In this paper, we present a method using pixel-level information, local region-level information and global-level information to remove shadow. At the pixel-level, we employ GMM t...
GRAPHICSINTERFACE
2001
13 years 9 months ago
2001
Weathering phenomena represent a topic of growing interest in computer graphics, and corrosion reactions are of great importance since they affect a large number of different fiel...