1578 search results - page 50 / 316 » Algorithmic randomness of continuous functions |
178
click to vote
VMV
2001
15 years 7 months ago
2001
This contribution presents a new class of MRF, that is inspired by methods of statistical physics. The new energy function assumes full-connectivity in the neighborhood system and...
156
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
172
click to vote
ATAL
2009
Springer
16 years 16 days ago
2009
Springer
Many problems of multiagent planning under uncertainty require distributed reasoning with continuous resources and resource limits. Decentralized Markov Decision Problems (Dec-MDP...
153
click to vote
FOCS
2009
IEEE
16 years 21 days ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
182
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...