3422 search results - page 97 / 685 » Random Subset Optimization |
122
Voted
MCS
2009
Springer
15 years 9 months ago
2009
Springer
The classification of hyperspectral imagery, using multiple classifier systems is discussed and an SVM-based ensemble is introduced. The data set is separated into separate featu...
114
click to vote
AAAI
2010
15 years 2 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
108
click to vote
KDD
2000
ACM
15 years 6 months ago
2000
ACM
Having access to large data sets for the purpose of predictive data mining does not guarantee good models, even when the size of the training data is virtually unlimited. Instead,...
118
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
In this work we deal with one-round key-agreement protocols, called Merkle's Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a rando...
175
Voted
IJCV
2006
15 years 2 months ago
2006
Subspacefacerecognitionoftensuffersfromtwoproblems:(1)thetrainingsamplesetissmallcompared with the high dimensional feature vector; (2) the performance is sensitive to the subspace...