Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
In this paper we propose a power penalty approach to linear complementarity problems (LCP) in a finite dimensional space. This approach is based on approximating the LCP by a nonl...
We investigate the asymptotic properties of a recursive kernel density estimator associated with the driven noise of a linear regression in adaptive tracking. We provide an almost ...
We present an algorithm for computing the convex hull of freeform rational surfaces. The convex hull problem is reformulated as one of finding the zero-sets of polynomial equation...
Joon-Kyung Seong, Gershon Elber, John K. Johnstone...
We present an approach to visualize textual case bases by "stacking" similar cases and features close to each other in an image derived from the casefeature matrix. We pr...