Sciweavers

7930 search results - page 431 / 1586
» Greedy in Approximation Algorithms
Sort
View
NA
2007
120views more  NA 2007»
15 years 6 months ago
On choosing "optimal" shape parameters for RBF approximation
Many radial basis function (RBF) methods contain a free shape parameter that plays an important role for the accuracy of the method. In most papers the authors end up choosing this...
Gregory E. Fasshauer, Jack G. Zhang
JMLR
2010
148views more  JMLR 2010»
15 years 1 months ago
Approximate Inference on Planar Graphs using Loop Calculus and Belief Propagation
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
Vicenç Gómez, Hilbert J. Kappen, Mic...
DAC
2011
ACM
14 years 6 months ago
Efficient incremental analysis of on-chip power grid via sparse approximation
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
Pei Sun, Xin Li, Ming Yuan Ting
ECCV
2010
Springer
15 years 10 months ago
A Novel Parameter Estimation Algorithm for the Multivariate t-Distribution and Its Application to Computer
Abstract. We present a novel algorithm for approximating the parameters of a multivariate t-distribution. At the expense of a slightly decreased accuracy in the estimates, the prop...
JAIR
2010
130views more  JAIR 2010»
15 years 5 months ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...