1973 search results - page 79 / 395 » The Construction of Ludic Space |
153
click to vote
PAKDD
2009
ACM
16 years 1 months ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
162
click to vote
ICRA
2009
IEEE
16 years 28 days ago
2009
IEEE
² Similar to humans and primates, artificial creatures like robots are limited in terms of allocation of their resources to huge sensory and perceptual information. Serial process...
169
click to vote
IPPS
2009
IEEE
16 years 28 days ago
2009
IEEE
We consider the following basic question: a source node wishes to stream an ordered sequence of packets to a collection of receivers, which are distributed among a number of clust...
179
click to vote
ICDE
2007
IEEE
16 years 18 days ago
2007
IEEE
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
139
click to vote
ICDCS
2006
IEEE
16 years 9 days ago
2006
IEEE
Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes ...