Sciweavers

358 search results - page 26 / 72
» Sparse squares of polynomials
Sort
View
DAM
2007
107views more  DAM 2007»
13 years 9 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
NN
2010
Springer
189views Neural Networks» more  NN 2010»
13 years 3 months ago
Sparse kernel learning with LASSO and Bayesian inference algorithm
Kernelized LASSO (Least Absolute Selection and Shrinkage Operator) has been investigated in two separate recent papers (Gao et al., 2008) and (Wang et al., 2007). This paper is co...
Junbin Gao, Paul W. Kwan, Daming Shi
ISBI
2009
IEEE
14 years 3 months ago
3D Eigenfunction Expansion of Sparsely Sampled 2D Cortical Data
Various cortical measures such as cortical thickness are routinely computed along the vertices of cortical surface meshes. These metrics are used in surface-based morphometric stu...
Moo K. Chung, Yu-Chien Wu, Andrew L. Alexander
ESANN
2006
13 years 10 months ago
Visual object classification by sparse convolutional neural networks
Abstract. A convolutional network architecture termed sparse convolutional neural network (SCNN) is proposed and tested on a real-world classification task (car classification). In...
Alexander Gepperth
ICASSP
2010
IEEE
13 years 9 months ago
Semi-Supervised Hyperspectral Unmixing via the Weighted Lasso
In this paper a novel approach for semi-supervised hyperspectral unmixing is presented. First, it is shown that this problem inherently accepts a sparse solution. Then, based on t...
Konstantinos Themelis, Athanasios A. Rontogiannis,...