2137 search results - page 279 / 428 » Experiments on Graph Clustering Algorithms |
PAMI
2006
13 years 9 months ago
2006
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
IJRR
2002
13 years 8 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
JMLR
2010
13 years 3 months ago
2010
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
EUROPAR
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The functional performance model (FPM) of heterogeneous processors has proven to be more realistic than the traditional models because it integrates many important featur...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
This paper describes our procedure and a software application for conducting large parameter sweep experiments in genetic and evolutionary computation research. Both procedure and...