2310 search results - page 162 / 462 » Coloring Random Graphs |
114
Voted
DAC
2009
ACM
15 years 9 months ago
2009
ACM
For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verifica...
181
Voted
CRV
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we propose a novel method for the automatic segmentation of a foreground layer from a natural scene in real time by fusing infrared, color and edge information. Thi...
137
click to vote
ICCTA
2007
IEEE
15 years 6 months ago
2007
IEEE
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
114
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
113
click to vote
PAKDD
2009
ACM
15 years 11 months ago
2009
ACM
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...