59 search results - page 10 / 12 » Generating Labeled Planar Graphs Uniformly at Random |
AAAI
2008
15 years 1 months ago
2008
We describe a simple environment to study cooperation between two agents and a method of achieving cooperation in that environment. The environment consists of randomly generated ...
STOC
2010
ACM
14 years 11 months ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
111
click to vote
MICCAI
2010
Springer
14 years 10 months ago
2010
Springer
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
APPROX
2005
Springer
15 years 5 months ago
2005
Springer
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...