1067 search results - page 178 / 214 » Probabilistic regular graphs |
122
click to vote
JSAC
2008
15 years 12 days ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
117
click to vote
JCO
1998
15 years 3 days ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
232
Voted
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
118
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
— This paper describes the winning entry to the IJCNN 2011 Social Network Challenge run by Kaggle.com. The goal of the contest was to promote research on realworld link predictio...
121
click to vote
ICRA
2009
IEEE
14 years 10 months ago
2009
IEEE
In Simultaneous Localisation and Mapping (SLAM), it is well known that probabilistic filtering approaches which aim to estimate the robot and map state sequentially suffer from poo...