Sciweavers

5138 search results - page 429 / 1028
» Low-Entropy Set Selection.
Sort
View
ICPR
2000
IEEE
16 years 8 months ago
Measuring the Complexity of Classification Problems
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
Tin Kam Ho, Mitra Basu
ICML
2005
IEEE
16 years 8 months ago
Fast condensed nearest neighbor rule
We present a novel algorithm for computing a training set consistent subset for the nearest neighbor decision rule. The algorithm, called FCNN rule, has some desirable properties....
Fabrizio Angiulli
CHES
2009
Springer
162views Cryptology» more  CHES 2009»
16 years 8 months ago
Programmable and Parallel ECC Coprocessor Architecture: Tradeoffs between Area, Speed and Security
Elliptic Curve Cryptography implementations are known to be vulnerable to various side-channel attacks and fault injection attacks, and many countermeasures have been proposed. How...
Xu Guo, Junfeng Fan, Patrick Schaumont, Ingrid Ver...
KDD
2004
ACM
103views Data Mining» more  KDD 2004»
16 years 8 months ago
An objective evaluation criterion for clustering
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...
Arindam Banerjee, John Langford
CHI
2007
ACM
16 years 8 months ago
Getting our head in the clouds: toward evaluation studies of tagclouds
Tagclouds are visual presentations of a set of words, typically a set of "tags" selected by some rationale, in which attributes of the text such as size, weight, or colo...
A. W. Rivadeneira, Daniel M. Gruen, Michael J. Mul...