JMLR
2002
13 years 9 months ago
2002
We define notions of stability for learning algorithms and show how to use these notions to derive generalization error bounds based on the empirical error and the leave-one-out e...
JMLR
2002
13 years 9 months ago
2002
We present a class of algorithms for independent component analysis (ICA) which use contrast functions based on canonical correlations in a reproducing kernel Hilbert space. On th...
CORR
1999
Springer
13 years 9 months ago
1999
Springer
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm...
JACM
1998
13 years 9 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
JIFS
2002
13 years 9 months ago
2002
This work addresses the problem of finding the adjustable parameters of a learning algorithm using Genetic Algorithms. This problem is also known as the model selection problem. In...
JGAA
2002
13 years 9 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
JETAI
2002
13 years 9 months ago
2002
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algo...
COMGEO
1999
ACM
13 years 9 months ago
1999
ACM
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
COMGEO
1999
ACM
13 years 9 months ago
1999
ACM
The visual nature of geometry applications makes them a natural area where visualization can be an effective tool for demonstrating algorithms. In this paper we propose a new mode...
INFORMATICALT
1998
13 years 9 months ago
1998
Abstract. We study invertibility of big n × n matrices. There exists a number of algorithms, especially in mathematical statistics and numerical mathematics, requiring to invert s...