1067 search results - page 71 / 214 » Probabilistic regular graphs |
122
Voted
NIPS
2004
15 years 1 months ago
2004
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...
108
Voted
JSC
2010
14 years 11 months ago
2010
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
83
Voted
CORR
2008
Springer
15 years 20 days ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...
110
click to vote
WG
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
114
click to vote
ICDM
2010
IEEE
14 years 10 months ago
2010
IEEE
How do connected components evolve? What are the regularities that govern the dynamic growth process and the static snapshot of the connected components? In this work, we study pat...