Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Linear scale-space theory provides a useful framework to quantify the differential and integral geometry of spatio-temporal input images. In this paper that geometry comes about by...
Alfons H. Salden, Bart M. ter Haar Romeny, Max A. ...
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...
Sam T. Roweis, Lawrence K. Saul, Geoffrey E. Hinto...