164 search results - page 31 / 33 » On k-Anonymity and the Curse of Dimensionality |
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
ICMCS
2005
IEEE
13 years 11 months ago
2005
IEEE
ABSTRACT In this paper, we report our experiments using a realworld image dataset to examine the effectiveness of Isomap, LLE and KPCA. The 1,897-image dataset we used consists of ...
MMM
2005
Springer
13 years 11 months ago
2005
Springer
The canonical face recognition algorithm Eigenface and Fisherface are both based on one dimensional vector representation. However, with the high feature dimensions and the small ...
ADBIS
2003
Springer
13 years 10 months ago
2003
Springer
Recent research has shown the integration of multiple classifiers to be one of the most important directions in machine learning and data mining. It was shown that, for an ensemble...
IWANN
1999
Springer
13 years 9 months ago
1999
Springer
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...