2310 search results - page 205 / 462 » Coloring Random Graphs |
255
click to vote
CVPR
2011
IEEE
14 years 10 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...
143
click to vote
EMNLP
2011
14 years 2 months ago
2011
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
108
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
128
click to vote
AOSD
2007
ACM
15 years 6 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
134
click to vote
JSAC
2008
15 years 2 months 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 = ...