5606 search results - page 101 / 1122 » Randomization Techniques for Graphs. |
133
Voted
STOC
2012
ACM
13 years 3 months ago
2012
ACM
108
click to vote
ICML
2004
IEEE
16 years 1 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...
107
Voted
APPROX
2009
Springer
15 years 7 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...
74
Voted
APAL
2008
15 years 26 days 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...
CPC
2006
15 years 23 days ago
2006
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...