The simplex algorithm computes the simplex multipliers by solving a system (or two triangular systems) at each iteration. This note offers an efficient approach to updating the sim...
The performance of supervised learners depends on the presence of a relatively large labeled sample. This paper proposes an automatic ongoing learning system, which is able to inco...
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
This paper presents a new and efficient algorithm for the decomposition of 3D arbitrary triangle meshes and particularly optimized triangulated CAD meshes. The algorithm is based ...
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...