Result 1 to 20 of 29 total
Multiclass classification with potential function rules: margin distribution and generalization. (English)
Pattern Recognition 45, No. 1, 540-551 (2012).
1
Quasi-Monte Carlo methods for high-dimensional integration: the standard (weighted Hilbert space) setting and beyond. (English)
ANZIAM J. 53, No. 1, 1-37 (2011).
2
On the component by component construction of polynomial lattice point sets for numerical integration in weighted Sobolev spaces. (English)
Unif. Distrib. Theory 6, No. 1, 79-100 (2011).
3
Learning with box kernels. (English)
Lu, Bao-Liang (ed.) et al., Neural information processing. 18th international conference, ICONIP 2011, Shanghai, China, November 13‒17, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-24957-0/pbk). Lecture Notes in Computer Science 7063, 519-528 (2011).
4
Randomly shifted lattice rules with the optimal rate of convergence for unbounded integrands. (English)
J. Complexity 26, No. 2, 135-160 (2010).
5
Approximation by exponential sums revisited. (English)
Appl. Comput. Harmon. Anal. 28, No. 2, 131-149 (2010).
6
Brownian bridge and principal component analysis: Towards removing the curse of dimensionality. (English)
IMA J. Numer. Anal. 27, No. 4, 631-654 (2007).
7
Constructions of general polynomial lattices for multivariate integration. (English)
Bull. Aust. Math. Soc. 76, No. 1, 93-110 (2007).
8
The tent transformation can improve the convergence rate of quasi-Monte Carlo algorithms using digital nets. (English)
Numer. Math. 105, No. 3, 413-455 (2007).
9
Randomly shifted lattice rules for unbounded integrands. (English)
J. Complexity 22, No. 5, 630-651 (2006).
10
Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions. (English)
J. Complexity 22, No. 1, 71-101 (2006).
11
Fast algorithms for component-by-component construction of rank-$ 1$ lattice rules in shift-invariant reproducing kernel Hilbert spaces. (English)
Math. Comput. 75, No. 254, 903-920 (2006).
12
Efficient and interpretable fuzzy classifiers from data with support vector learning. (English)
Intell. Data Anal. 9, No. 6, 527-550 (2005).
13
Fixed-parameter tractability and data reduction for multicut in trees. (English)
Networks 46, No. 3, 124-135 (2005).
14
Finite-order weights imply tractability of multivariate integration. (English)
J. Complexity 20, No. 1, 46-74 (2004).
15
Enumeration of convex polyominoes using the ECO method. (English)
Morvan, Michel (ed.) et al., Discrete models for complex systems, DMCS’03. Proceedings of the conference, Lyon, France, June 16-19, 2003. Paris: Maison de l’Informatique et des Mathématiques Discrètes (MIMD), Discrete Math. Theor. Comput. Sci., Proc. AB, 103-116, electronic only (2003).
16
Tractability of multivariate integration for periodic functions. (English)
J. Complexity 17, No.4, 660-682 (2001).
17
On the posterior-probability estimate of the error rate of nonparametric classification rules. (English)
IEEE Trans. Inf. Theory 40, No.2, 475-481 (1994).
18
Kernel classification rules from missing data. (English)
IEEE Trans. Inf. Theory 39, No.3, 979-988 (1993).
19
On exponential bounds on the Bayes risk of the nonparametric classification rules. (English)
Nonparametric functional estimation and related topics, NATO ASI Ser., Ser. C 335, 347-360 (1991).
20
Result 1 to 20 of 29 total
Start
Contact
Print
General Help
