Result 1 to 20 from 116 total
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching. (English)
Eur. J. Comb. 34, No. 1, 38-51 (2013).
1
On sequential Monte Carlo, partial rejection control and approximate Bayesian computation. (English)
Stat. Comput. 22, No. 6, 1209-1222 (2012).
2
An adaptive sequential Monte Carlo method for approximate Bayesian computation. (English)
Stat. Comput. 22, No. 5, 1009-1020 (2012).
3
H-tree: a hybrid structure for confidence computation in probabilistic databases. (English)
Sheng, Quan Z. (ed.) et al., Web technologies and applications. 14th Asia-Pacific web conference, APWeb 2012, Kunming, China, April 11‒13, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29252-1/pbk). Lecture Notes in Computer Science 7235, 195-206 (2012).
4
A tutorial on approximate Bayesian computation. (English)
J. Math. Psychol. 56, No. 2, 69-85 (2012).
5
Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method. (Russian ;English)
Zh. Vychisl. Mat. Mat. Fiz. 52, No. 2, 179-204 (2012); translation in Comput. Math. Math. Phys. 52, No. 2, 169-193 (2012).
6
Approximate GCD of several univariate polynomials with small degree perturbations. (English)
J. Symb. Comput. 47, No. 4, 410-421 (2012).
7
An approximate solution of the Jaynes-Cummings model with dissipation. (English)
Int. J. Geom. Methods Mod. Phys. 8, No. 8, 1799-1814 (2011).
8
An approximately universal set consisting of two observables. (English)
Int. J. Quantum Inf. 9, No. 6, 1393-1412 (2011).
9
Likelihood-free MCMC. (English)
Brooks, Steve (ed.) et al., Handbook of Markov chain Monte Carlo. Boca Raton, FL: CRC Press (ISBN 978-1-4200-7941-8/hbk; 978-1-4200-7942-5/ebook). Chapman \& Hall/CRC Handbooks of Modern Statistical Methods, 313-335 (2011).
10
Approximate inference in Bayesian networks using binary probability trees. (English)
Int. J. Approx. Reasoning 52, No. 1, 49-62 (2011).
11
Chain ladder method: Bayesian bootstrap versus classical bootstrap. (English)
Insur. Math. Econ. 47, No. 1, 36-51 (2010).
12
Parallel hybrid preconditioning: incomplete factorization with selective sparse approximate inversion. (English)
SIAM J. Sci. Comput. 32, No. 3, 1323-1345 (2010).
13
Application of adapted homotopy perturbation method for approximate solution of Henon-Heiles system. (English)
Numer. Methods Partial Differ. Equations 26, No. 6, 1522-1529 (2010).
14
Strong order-preserving renaming in the synchronous message passing model. (English)
Theor. Comput. Sci. 411, No. 40-42, 3787-3794 (2010).
15
Recursive probability trees for Bayesian networks. (English)
Meseguer, Pedro (ed.) et al., Current topics in artificial intelligence. 13th conference of the Spanish association for artificial intelligence, CAEPIA 2009, Seville, Spain, November 9‒13, 2009. Selected papers. Berlin: Springer (ISBN 978-3-642-14263-5/pbk). Lecture Notes in Computer Science 5988. Lecture Notes in Artificial Intelligence, 242-251 (2010).
16
Approximate polynomial GCD: small degree and small height perturbations. (English)
J. Symb. Comput. 45, No. 8, 879-886 (2010).
17
An approximate matrix inversion procedure by parallelization of the Sherman-Morrison formula. (English)
ANZIAM J. 51, No. 1, 1-9 (2009).
18
Pseudo-spectral derivative of quadratic quasi-interpolant splines. (English)
Rend. Semin. Mat., Univ. Politec. Torino 67, No. 3, 351-362 (2009).
19
High performance inverse preconditioning. (English)
Arch. Comput. Methods Eng. 16, No. 1, 77-108 (2009).
20
Result 1 to 20 from 116 total
Start
Contact
Print
General Help
