1542 search results - page 89 / 309 » The metamathematics of random graphs |
CPC
2004
15 years 1 months ago
2004
CPC
2004
15 years 1 months ago
2004
115
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
118
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
APAL
2008
15 years 1 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...