1722 search results - page 208 / 345 » On the sample mean of graphs |
204
click to vote
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper, we propose a novel algorithm for computing an atlas from a collection of images. In the literature, atlases have almost always been computed as some types of means ...
195
click to vote
COLT
2010
Springer
15 years 5 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
248
click to vote
FUN
2010
Springer
15 years 10 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
233
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
232
click to vote
STOC
2010
ACM
16 years 2 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...