Sciweavers

719 search results - page 29 / 144
» Solving Sparse Linear Constraints
Sort
View
CP
2007
Springer
15 years 2 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
ICML
2007
IEEE
15 years 11 months ago
Sparse eigen methods by D.C. programming
Eigenvalue problems are rampant in machine learning and statistics and appear in the context of classification, dimensionality reduction, etc. In this paper, we consider a cardina...
Bharath K. Sriperumbudur, David A. Torres, Gert R....
ICANN
2007
Springer
15 years 4 months ago
Sparse Least Squares Support Vector Regressors Trained in the Reduced Empirical Feature Space
Abstract. In this paper we discuss sparse least squares support vector regressors (sparse LS SVRs) defined in the reduced empirical feature space, which is a subspace of mapped tr...
Shigeo Abe, Kenta Onishi
ICASSP
2011
IEEE
14 years 2 months ago
Weighted and structured sparse total least-squares for perturbed compressive sampling
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data...
Hao Zhu, Georgios B. Giannakis, Geert Leus
IDA
2002
Springer
14 years 10 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel