Sciweavers

704 search results - page 12 / 141
» Learning the Ideal Evaluation Function
Sort
View
ML
2010
ACM
163views Machine Learning» more  ML 2010»
14 years 4 months ago
Classification with guaranteed probability of error
We introduce a general-purpose learning machine that we call the Guaranteed Error Machine, or GEM, and two learning algorithms, a real GEM algorithm and an ideal GEM algorithm. Th...
Marco C. Campi
FSE
2011
Springer
263views Cryptology» more  FSE 2011»
14 years 1 months ago
Practical Near-Collisions on the Compression Function of BMW
Abstract. Blue Midnight Wish (BMW) is one of the fastest SHA-3 candidates in the second round of the competition. In this paper we study the compression function of BMW and we obta...
Gaëtan Leurent, Søren S. Thomsen
CICLING
2009
Springer
15 years 10 months ago
Semantic Clustering for a Functional Text Classification Task
Abstract. We describe a semantic clustering method designed to address shortcomings in the common bag-of-words document representation for functional semantic classification tasks....
Thomas Lippincott, Rebecca J. Passonneau
SDM
2012
SIAM
216views Data Mining» more  SDM 2012»
13 years 15 hour ago
Feature Selection "Tomography" - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable
:  Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
George Forman
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
15 years 1 months ago
Speeding up the evaluation of evolutionary learning systems using GPGPUs
In this paper we introduce a method for computing fitness in evolutionary learning systems based on NVIDIA’s massive parallel technology using the CUDA library. Both the match ...
María A. Franco, Natalio Krasnogor, Jaume B...