Sciweavers

13214 search results - page 2318 / 2643
» Pseudorandomness for network algorithms
Sort
View
IJAR
2010
97views more  IJAR 2010»
15 years 5 months ago
Parameter estimation and model selection for mixtures of truncated exponentials
Bayesian networks with mixtures of truncated exponentials (MTEs) support efficient inference algorithms and provide a flexible way of modeling hybrid domains (domains containing ...
Helge Langseth, Thomas D. Nielsen, Rafael Rum&iacu...
JAIR
2010
145views more  JAIR 2010»
15 years 5 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint
JCO
2010
182views more  JCO 2010»
15 years 5 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
JPDC
2010
137views more  JPDC 2010»
15 years 5 months ago
Parallel exact inference on the Cell Broadband Engine processor
—We present the design and implementation of a parallel exact inference algorithm on the Cell Broadband Engine (Cell BE). Exact inference is a key problem in exploring probabilis...
Yinglong Xia, Viktor K. Prasanna
PVM
2010
Springer
15 years 5 months ago
Communication Target Selection for Replicated MPI Processes
Abstract. VolpexMPI is an MPI library designed for volunteer computing environments. In order to cope with the fundamental unreliability of these environments, VolpexMPI deploys tw...
Rakhi Anand, Edgar Gabriel, Jaspal Subhlok
« Prev « First page 2318 / 2643 Last » Next »