Sciweavers

901 search results - page 50 / 181
» Analyzing linear mergers
Sort
View
ICCSA
2003
Springer
15 years 4 months ago
Coarse-Grained Parallel Matrix-Free Solution of a Three-Dimensional Elliptic Prototype Problem
The finite difference discretization of the Poisson equation in three dimensions results in a large, sparse, and highly structured system of linear equations. This prototype prob...
Kevin P. Allen, Matthias K. Gobbert
NN
2000
Springer
165views Neural Networks» more  NN 2000»
14 years 11 months ago
Construction of confidence intervals for neural networks based on least squares estimation
We present the theoretical results about the construction of confidence intervals for a nonlinear regression based on least squares estimation and using the linear Taylor expansio...
Isabelle Rivals, Léon Personnaz
ICML
2010
IEEE
15 years 8 days ago
An Analysis of the Convergence of Graph Laplacians
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...
Daniel Ting, Ling Huang, Michael I. Jordan
ISSAC
1997
Springer
105views Mathematics» more  ISSAC 1997»
15 years 3 months ago
On Randomized Lanczos Algorithms
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algor...
Wayne Eberly, Erich Kaltofen
NIPS
2003
15 years 17 days ago
Information Dynamics and Emergent Computation in Recurrent Circuits of Spiking Neurons
We employ an efficient method using Bayesian and linear classifiers for analyzing the dynamics of information in high-dimensional states of generic cortical microcircuit models....
Thomas Natschläger, Wolfgang Maass