848 search results - page 109 / 170 » Randomness and the linear degrees of computability |
161
click to vote
SBACPAD
2006
IEEE
2006
IEEE
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
16 years 3 days ago
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
156
Voted
GD
2004
Springer
15 years 11 months ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...
144
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
144
click to vote
SIAMSC
2008
15 years 6 months ago
2008
Abstract. This paper presents a new stochastic preconditioning approach for large sparse matrices. For the class of matrices that are row-wise and column-wise irreducibly diagonall...
161
click to vote
SRDS
2006
IEEE
16 years 3 days ago
2006
IEEE
Availability prediction in a telecommunication system plays a crucial role in its management, either by alerting the operator to potential failures or by proactively initiating pr...