779 search results - page 38 / 156 » Algorithms for the Sample Mean of Graphs |
159
click to vote
EJC
2007
15 years 4 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
121
click to vote
COLT
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
121
click to vote
ICRA
2002
IEEE
15 years 9 months ago
2002
IEEE
As a general framework to determine a collision-free feedback motion strategies, the Random Neighborhood Graph (RNG) approach [19] defines a global navigation function over an ap...
130
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
134
click to vote
ILP
2004
Springer
15 years 9 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...