Sciweavers

119 search results - page 21 / 24
» Sparse kernel methods for high-dimensional survival data
Sort
View
BIBM
2008
IEEE
125views Bioinformatics» more  BIBM 2008»
13 years 9 months ago
On the Role of Local Matching for Efficient Semi-supervised Protein Sequence Classification
Recent studies in protein sequence analysis have leveraged the power of unlabeled data. For example, the profile and mismatch neighborhood kernels have shown significant improveme...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
ECML
2006
Springer
13 years 11 months ago
The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
Alexander N. Dolia, Tijl De Bie, Christopher J. Ha...
HPCN
1997
Springer
13 years 11 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher
KAIS
2008
221views more  KAIS 2008»
13 years 7 months ago
Forecasting skewed biased stochastic ozone days: analyses, solutions and beyond
Much work on skewed, stochastic, high dimensional, and biased datasets usually implicitly solve each problem separately. Recently, we have been approached by Texas Commission on En...
Kun Zhang, Wei Fan
CIKM
2010
Springer
13 years 6 months ago
Novel local features with hybrid sampling technique for image retrieval
In image retrieval, most existing approaches that incorporate local features produce high dimensional vectors, which lead to a high computational and data storage cost. Moreover, ...
Leszek Kaliciak, Dawei Song, Nirmalie Wiratunga, J...