5785 search results - page 120 / 1157 » Approximability of Probability Distributions |
163
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
139
click to vote
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...
122
Voted
ICPR
2000
IEEE
16 years 4 months ago
2000
IEEE
In this paper we focus on an interpretation of Gaussian radial basis functions (GRBF) which motivates extensions and learning strategies. Specifically, we show that GRBF regressio...
116
click to vote
UAI
1994
15 years 4 months ago
1994
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
138
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...