Sciweavers

848 search results - page 109 / 170
» Randomness and the linear degrees of computability
Sort
View
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
15 years 5 months ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
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...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...
GD
2004
Springer
15 years 5 months ago
Convex Drawings of 3-Connected Plane Graphs
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...
Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
15 years 3 months ago
Extractors for Low-Weight Affine Sources
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 ...
Anup Rao
SIAMSC
2008
132views more  SIAMSC 2008»
14 years 11 months ago
Stochastic Preconditioning for Diagonally Dominant Matrices
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...
Haifeng Qian, Sachin S. Sapatnekar
SRDS
2006
IEEE
15 years 5 months ago
Call Availability Prediction in a Telecommunication System: A Data Driven Empirical Approach
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...
Günther A. Hoffmann, Miroslaw Malek