Sciweavers

1772 search results - page 128 / 355
» Classifying Problems into Complexity Classes
Sort
View
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 7 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ICPR
2006
IEEE
16 years 7 months ago
Dissimilarity-based classification for vectorial representations
General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [11, 10]. They arise in problems in which direct comparisons of objects are made, e....
Elzbieta Pekalska, Robert P. W. Duin
MCS
2007
Springer
16 years 16 days ago
Stopping Criteria for Ensemble-Based Feature Selection
Selecting the optimal number of features in a classifier ensemble normally requires a validation set or cross-validation techniques. In this paper, feature ranking is combined with...
Terry Windeatt, Matthew Prior
KDD
2004
ACM
123views Data Mining» more  KDD 2004»
16 years 6 months ago
A DEA approach for model combination
This paper proposes a novel Data Envelopment Analysis (DEA) based approach for model combination. We first prove that for the 2-class classification problems DEA models identify t...
Zhiqiang Zheng, Balaji Padmanabhan, Haoqiang Zheng
INFORMATICALT
2008
104views more  INFORMATICALT 2008»
15 years 6 months ago
An Efficient Technique to Detect Visual Defects in Particleboards
This paper is concerned with the problem of image analysis based detection of local defects embedded in particleboard surfaces. Though simple, but efficient technique developed is ...
Jonas Guzaitis, Antanas Verikas