1722 search results - page 57 / 345 » On the sample mean of graphs |
162
click to vote
IJON
2010
15 years 3 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
162
click to vote
NAACL
2007
15 years 7 months ago
2007
Graph-based semi-supervised learning has recently emerged as a promising approach to data-sparse learning problems in natural language processing. All graph-based algorithms rely ...
174
click to vote
MANSCI
2007
15 years 6 months ago
2007
Selection procedures are used in a variety of applications to select the best of a finite set of alternatives. ‘Best’ is defined with respect to the largest mean, but the me...
158
click to vote
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
The dynamics of neural and other automata networks are defined to a large extent by their topologies. Artificial evolution constitutes a practical means by which an optimal topolog...
151
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...