There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast ...
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
In this article we present an algorithm to determine the intersection between rays and triangles based on the idea of the study of signs with respect to triangles. One of the adva...
— This paper presents an energy back-propagation algorithm (EBP). Learning and convergence processes of the standard backpropagation algorithm (SBP) are based on the energy funct...
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...