1067 search results - page 24 / 214 » Probabilistic regular graphs |
97
Voted
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication sof...
106
click to vote
EJC
2008
15 years 15 days ago
2008
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
WDAG
2000
Springer
15 years 4 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
112
Voted
ESA
2001
Springer
15 years 5 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
NIPS
2004
15 years 1 months ago
2004
We provide a principle for semi-supervised learning based on optimizing the rate of communicating labels for unlabeled points with side information. The side information is expres...