1973 search results - page 205 / 395 » The Construction of Ludic Space |
182
click to vote
NIPS
2004
15 years 7 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
188
click to vote
IIS
2003
15 years 7 months ago
2003
Text clustering typically involves clustering in a high dimensional space, which appears difficult with regard to virtually all practical settings. In addition, given a particular...
172
click to vote
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
15 years 7 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
167
click to vote
IJCAI
1989
15 years 7 months ago
1989
In many applications in mobile robotics, it is important for a robot to explore its environment in order to construct a representation of space useful for guiding movement. We refe...
176
click to vote
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...