376 search results - page 37 / 76 » Completely connected clustered graphs |
JCO
2007
13 years 7 months ago
2007
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
CRYPTO
2012
Springer
11 years 10 months ago
2012
Springer
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
PRL
2007
13 years 7 months ago
2007
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
DDECS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...