Sciweavers

3757 search results - page 365 / 752
» The overlap number of a graph
Sort
View
EC
2007
118views ECommerce» more  EC 2007»
15 years 6 months ago
Geometric Crossovers for Multiway Graph Partitioning
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly r...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byun...
PR
2007
141views more  PR 2007»
15 years 6 months ago
A Riemannian approach to graph embedding
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
Antonio Robles-Kelly, Edwin R. Hancock
PAMI
2010
103views more  PAMI 2010»
15 years 5 months ago
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...
Amin Mantrach, Luh Yen, Jérôme Callut...
ICAI
2010
15 years 4 months ago
Exact Loopy Belief Propagation on Euler Graphs
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
Chen-Hsiang Yeang
CN
2010
121views more  CN 2010»
15 years 3 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...