497 search results - page 76 / 100 » Study on Feature Selection Algorithm in Topic Tracking |
SODA
2010
ACM
14 years 7 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
IJCNN
2008
IEEE
15 years 3 months ago
2008
IEEE
Abstract— Meta-Learning has been used to predict the performance of learning algorithms based on descriptive features of the learning problems. Each training example in this cont...
82
Voted
ISCC
2003
IEEE
15 years 2 months ago
2003
IEEE
Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in n...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— In this paper we consider packet networks loaded by admissible traffic patterns, i.e. by traffic patterns that, if optimally routed, do not overload network resources. In the...