5580 search results - page 615 / 1116 » Randomized priority algorithms |
159
click to vote
WSCG
2004
15 years 6 months ago
2004
In this paper we describe a new method for improving the representation of textures in blends of multiple images based on a Markov Random Field (MRF) algorithm. We show that direc...
147
click to vote
UAI
2003
15 years 6 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
164
click to vote
SODA
2000
ACM
15 years 6 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
136
click to vote
ICANN
2010
Springer
15 years 5 months ago
2010
Springer
Independent Component Analysis (ICA) is a statistical computation method that transforms a random vector in another one whose components are independent. Because the marginal distr...
97
Voted
CACM
2008
15 years 5 months ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...