779 search results - page 52 / 156 » Algorithms for the Sample Mean of Graphs |
135
click to vote
NIPS
2008
15 years 5 months ago
2008
In this paper we introduce the MeanNN approach for estimation of main information theoretic measures such as differential entropy, mutual information and divergence. As opposed to...
244
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
127
click to vote
TCS
2010
15 years 2 months ago
2010
We consider the problem of actively learning the mean values of distributions associated with a finite number of options. The decision maker can select which option to generate t...
134
click to vote
GD
2000
Springer
15 years 8 months ago
2000
Springer
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
146
click to vote
JGAA
2002
15 years 4 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...