Sciweavers

1282 search results - page 90 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
CPHYSICS
2010
184views more  CPHYSICS 2010»
13 years 10 months ago
Parallel Newton-Krylov-Schwarz algorithms for the three-dimensional Poisson-Boltzmann equation in numerical simulation of colloi
We investigate fully parallel Newton-Krylov-Schwarz (NKS) algorithms for solving the large sparse nonlinear systems of equations arising from the finite element discretization of ...
Feng-Nan Hwang, Shang-Rong Cai, Yun-Long Shao, Jon...
UAI
2003
13 years 11 months ago
An Importance Sampling Algorithm Based on Evidence Pre-propagation
Precision achieved by stochastic sampling algorithms for Bayesian networks typically deteriorates in face of extremely unlikely evidence. To address this problem, we propose the E...
Changhe Yuan, Marek J. Druzdzel
CP
2007
Springer
14 years 2 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
VLSISP
2002
124views more  VLSISP 2002»
13 years 10 months ago
Agglomerative Learning Algorithms for General Fuzzy Min-Max Neural Network
In this paper two agglomerative learning algorithms based on new similarity measures defined for hyperbox fuzzy sets are proposed. They are presented in a context of clustering and...
Bogdan Gabrys
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 10 months ago
Particle Filtering for Large Dimensional State Spaces with Multimodal Observation Likelihoods
We study efficient importance sampling techniques for particle filtering (PF) when either (a) the observation likelihood (OL) is frequently multimodal or heavy-tailed, or (b) the s...
Namrata Vaswani