1722 search results - page 55 / 345 » On the sample mean of graphs |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
ALT
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we consider the problem of actively learning the mean values of distributions associated with a finite number of options (arms). The algorithms can select which opti...
GD
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
100
click to vote
CVPR
2007
IEEE
16 years 4 days ago
2007
IEEE
We propose a new approach to compute non-linear, intrinsic shape statistics and to incorporate them into a shape prior for an image segmentation task. Given a sample set of contou...