581 search results - page 32 / 117 » EM in High Dimensional Spaces |
SODA
2000
ACM
15 years 1 days ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
NIPS
1993
15 years 1 days ago
1993
Parti-game is a new algorithm for learning feasible trajectories to goal regions in high dimensionalcontinuousstate-spaces. In high dimensions it is essential that learningdoes not...
109
click to vote
DEXAW
2007
IEEE
15 years 2 months ago
2007
IEEE
Peers and data objects in the Hybrid Overlay Network (HON) are organized in a ndimensional feature space. As the dimensionality increases, peers and data objects become sparse and ...
AAAI
2007
15 years 1 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
112
click to vote
WIRN
2005
Springer
15 years 4 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...