Sciweavers

57 search results - page 4 / 12
» An Improved Model Selection Heuristic for AUC
Sort
View
AUSAI
2004
Springer
14 years 1 months ago
A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
Songshan Guo, Ying Kong, Andrew Lim, Fan Wang
HEURISTICS
1998
252views more  HEURISTICS 1998»
13 years 7 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
CVPR
2012
IEEE
11 years 10 months ago
Background modeling using adaptive pixelwise kernel variances in a hybrid feature space
Recent work on background subtraction has shown developments on two major fronts. In one, there has been increasing sophistication of probabilistic models, from mixtures of Gaussi...
Manjunath Narayana, Allen R. Hanson, Erik G. Learn...
ACMMSP
2004
ACM
101views Hardware» more  ACMMSP 2004»
14 years 1 months ago
Metrics and models for reordering transformations
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
Michelle Mills Strout, Paul D. Hovland
IDA
2002
Springer
13 years 7 months ago
Evolutionary model selection in unsupervised learning
Feature subset selection is important not only for the insight gained from determining relevant modeling variables but also for the improved understandability, scalability, and pos...
YongSeog Kim, W. Nick Street, Filippo Menczer