1434 search results - page 86 / 287 » Distributed Computing with Imperfect Randomness |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
MOBICOM
2003
ACM
14 years 29 days ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
AIRS
2004
Springer
14 years 1 months ago
2004
Springer
Carrying out experiments in Information Retrieval is a heavy activity requiring fast tools to treat collections of significant size, and at the same time flexible tools to leave...