376 search results - page 28 / 76 » Completely connected clustered graphs |
ICUMT
2009
13 years 5 months ago
2009
This paper investigates topology management of large wireless sensor networks. Due to their random deployment, nodes have to organize themselves as energy efficient as possible to ...
Publication
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
COMBINATORICA
2007
13 years 7 months ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...