Sciweavers

573 search results - page 74 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
ICCAD
1999
IEEE
101views Hardware» more  ICCAD 1999»
14 years 1 months ago
Efficient model reduction of interconnect via approximate system gramians
Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alte...
Jing-Rebecca Li, Jacob White
CAP
2010
13 years 4 months ago
Polynomial homotopies on multicore workstations
Homotopy continuation methods to solve polynomial systems scale very well on parallel machines. In this paper we examine its parallel implementation on multiprocessor multicore wo...
Jan Verschelde, Genady Yoffe
NIPS
2008
13 years 10 months ago
Accelerating Bayesian Inference over Nonlinear Differential Equations with Gaussian Processes
Identification and comparison of nonlinear dynamical system models using noisy and sparse experimental data is a vital task in many fields, however current methods are computation...
Ben Calderhead, Mark Girolami, Neil D. Lawrence
SIAMSC
2008
148views more  SIAMSC 2008»
13 years 9 months ago
Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
A multilevel adaptive aggregation method for calculating the stationary probability vector of an irreducible stochastic matrix is described. The method is a special case of the ada...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...
ECCV
2010
Springer
14 years 1 months ago
Error-tolerant Image Compositing
Abstract. Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and...