Sciweavers

5 search results - page 1 / 1
» Efficient Spectral Sparse Grid Methods and Applications to H...
Sort
View
SIAMSC
2010
142views more  SIAMSC 2010»
12 years 11 months ago
Efficient Spectral Sparse Grid Methods and Applications to High-Dimensional Elliptic Problems
Abstract. We develop in this paper some efficient algorithms which are essential to implementations of spectral methods on the sparse grid by Smolyak's construction based on a...
Jie Shen, Haijun Yu
ICML
2010
IEEE
13 years 5 months ago
Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
Mingkui Tan, Li Wang, Ivor W. Tsang
SDM
2004
SIAM
253views Data Mining» more  SDM 2004»
13 years 6 months ago
Density-Connected Subspace Clustering for High-Dimensional Data
Several application domains such as molecular biology and geography produce a tremendous amount of data which can no longer be managed without the help of efficient and effective ...
Peer Kröger, Hans-Peter Kriegel, Karin Kailin...
BMCBI
2007
158views more  BMCBI 2007»
13 years 4 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...
NIPS
2004
13 years 6 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson