164 search results - page 13 / 33 » On k-Anonymity and the Curse of Dimensionality |
NIPS
2004
14 years 10 months ago
2004
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
EOR
2006
14 years 9 months ago
2006
This paper is concerned with workload minimization in re-entrant lines with exponential service times and preemptive control policies. Using a numerical algorithm called the power...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Linear Discriminant Analysis (LDA) is one of the wellknown methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope w...
ICANN
2005
Springer
15 years 3 months ago
2005
Springer
For this special session of EU projects in the area of NeuroIT, we will review the progress of the MirrorBot project with special emphasis on its relation to reinforcement learning...
FSKD
2006
Springer
15 years 1 months ago
2006
Springer
Nearest neighbor classifier is a widely-used effective method for multi-class problems. However, it suffers from the problem of the curse of dimensionality in high dimensional spac...