Sciweavers

1356 search results - page 139 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
JCST
2008
119views more  JCST 2008»
13 years 9 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
GLOBECOM
2008
IEEE
14 years 3 months ago
Collusion-Resistant Multi-Winner Spectrum Auction for Cognitive Radio Networks
—In order to fully utilize spectrum, auction-based dynamic spectrum allocation has become a promising approach which allows unlicensed wireless users to lease unused bands from s...
Yongle Wu, Beibei Wang, K. J. Ray Liu, T. Charles ...
NIPS
2008
13 years 10 months ago
Beyond Novelty Detection: Incongruent Events, when General and Specific Classifiers Disagree
Unexpected stimuli are a challenge to any machine learning algorithm. Here we identify distinct types of unexpected events, focusing on 'incongruent events' when 'g...
Daphna Weinshall, Hynek Hermansky, Alon Zweig, Jie...
COMPGEOM
2006
ACM
14 years 3 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
ENC
2005
IEEE
14 years 2 months ago
Saving Evaluations in Differential Evolution for Constrained Optimization
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
Efrén Mezura-Montes, Carlos A. Coello Coell...