779 search results - page 18 / 156 » Algorithms for the Sample Mean of Graphs |
110
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
In this paper, we exploit a novel ranking mechanism that processes query samples with noisy labels, motivated by the practical application of web image search re-ranking where the...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
WWW
2010
ACM
15 years 4 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...