774 search results - page 1 / 155 » A subdivision-based algorithm for the sparse resultant |
CGI
1997
IEEE
14 years 2 months ago
1997
IEEE
In order to achieve the impression of a smooth surface while rendering a polygon mesh, normal vector vectors may be provided in the vertices of the mesh that are the average of th...
JACM
2000
13 years 11 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
PKDD
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Principal component analysis (PCA) and its dual—principal coordinate analysis (PCO)—are widely applied to unsupervised dimensionality reduction. In this paper, we sho...
ICMLA
2009
13 years 9 months ago
2009
Sparse representation for machine learning has been exploited in past years. Several sparse representation based classification algorithms have been developed for some application...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...