Sciweavers

2740 search results - page 51 / 548
» Approximating Component Selection
Sort
View
ICANN
2007
Springer
15 years 1 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel
ICML
2009
IEEE
15 years 10 months ago
Partially supervised feature selection with regularized linear models
This paper addresses feature selection techniques for classification of high dimensional data, such as those produced by microarray experiments. Some prior knowledge may be availa...
Thibault Helleputte, Pierre Dupont
ICASSP
2010
IEEE
14 years 10 months ago
A comparison of approximate Viterbi techniques and particle filtering for data estimation in digital communications
We consider trellis-based algorithms for data estimation in digital communication systems. We present a general framework which includes approximate Viterbi algorithms like the M-...
Steffen Barembruch
MP
2010
162views more  MP 2010»
14 years 8 months ago
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
Paul Tseng
AAAI
2006
14 years 11 months ago
Efficient Active Fusion for Decision-Making via VOI Approximation
Active fusion is a process that purposively selects the most informative information from multiple sources as well as combines these information for achieving a reliable result ef...
Wenhui Liao, Qiang Ji