779 search results - page 55 / 156 » Algorithms for the Sample Mean of Graphs |
164
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...
158
click to vote
JODS
2007
15 years 4 months ago
2007
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...
119
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
130
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
127
click to vote
GD
1998
Springer
15 years 8 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...