Sciweavers

736 search results - page 38 / 148
» High-order functions and their ordering relations
Sort
View
JFP
2000
163views more  JFP 2000»
14 years 11 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini
BMCBI
2011
14 years 6 months ago
Predicting functionally important SNP classes based on negative selection
Background: With the advent of cost-effective genotyping technologies, genome-wide association studies allow researchers to examine hundreds of thousands of single nucleotide poly...
Mark A. Levenstien, Robert J. Klein
CVPR
2008
IEEE
16 years 1 months ago
Robust tensor factorization using R1 norm
Over the years, many tensor based algorithms, e.g. two dimensional principle component analysis (2DPCA), two dimensional singular value decomposition (2DSVD), high order SVD, have...
Heng Huang, Chris H. Q. Ding
VISUALIZATION
1997
IEEE
15 years 4 months ago
A comparison of normal estimation schemes
The task of reconstructing the derivative of a discrete function is essential for its shading and rendering as well as being widely used in image processing and analysis. We surve...
Torsten Möller, Raghu Machiraju, Klaus Muelle...
SIAMSC
2010
155views more  SIAMSC 2010»
14 years 6 months ago
Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...
Berkant Savas, Lek-Heng Lim