3047 search results - page 152 / 610 » Randomized Parallel Selection |
213
click to vote
PAMI
2010
14 years 9 months ago
2010
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
ICPPW
2006
IEEE
15 years 5 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
SPAA
2003
ACM
15 years 4 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
PPSN
2004
Springer
15 years 4 months ago
2004
Springer
A radius–based separation of selection and recombination spheres in diffusion model EAs is introduced, enabling a new taxonomy, oriented towards information flow analysis. It a...
SBACPAD
2007
IEEE
15 years 5 months ago
2007
IEEE
We present node level primitives for parallel exact inference on an arbitrary Bayesian network. We explore the probability representation on each node of Bayesian networks and eac...