Sciweavers

4208 search results - page 16 / 842
» Better Selection of the Best
Sort
View
ISITA
2010
13 years 8 months ago
Spectral entropy-based bit allocation
In transform-based compression schemes, the task of choosing, quantizing, and coding the coefficients that best represent a signal is of prime importance. As a step in this directi...
Malavika Bhaskaranand, Jerry D. Gibson
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
14 years 4 months ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen
ICML
2010
IEEE
13 years 12 months ago
Online Streaming Feature Selection
We study an interesting and challenging problem, online streaming feature selection, in which the size of the feature set is unknown, and not all features are available for learni...
Xindong Wu, Kui Yu, Hao Wang, Wei Ding
KDD
2002
ACM
126views Data Mining» more  KDD 2002»
14 years 11 months ago
Integrating feature and instance selection for text classification
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...
Dimitris Fragoudis, Dimitris Meretakis, Spiros Lik...
NN
2000
Springer
145views Neural Networks» more  NN 2000»
13 years 10 months ago
Best approximation by Heaviside perceptron networks
In Lp-spaces with p [1, ) there exists a best approximation mapping to the set of functions computable by Heaviside perceptron networks with n hidden units; however for p (1, ) ...
Paul C. Kainen, Vera Kurková, Andrew Vogt