This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
This paper describes a new method to recover the sign of the local Gaussian curvature at each point on the visible surface of a 3-D object. Multiple (p > 3) shaded images are a...
Shinji Fukui, Yuji Iwahori, Akira Iwata, Robert J....
Principal component analysis (PCA) is a widely used statistical technique for unsupervised dimension reduction. K-means clustering is a commonly used data clustering for unsupervi...
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
A new algorithm to determine the number and value of realistic worst-case models for the performance of module library components is presented in this paper. The proposed algorith...