1542 search results - page 197 / 309 » The metamathematics of random graphs |
130
click to vote
SDM
2008
SIAM
15 years 3 months ago
2008
SIAM
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
110
click to vote
CLEF
2010
Springer
15 years 2 months ago
2010
Springer
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...
126
click to vote
COR
2010
15 years 1 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
118
click to vote
CN
2008
15 years 1 months ago
2008
The connectivity of the Internet crucially depends on the relationships between thousands of Autonomous Systems (ASes) that exchange routing information using the Border Gateway P...
138
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...