1542 search results - page 242 / 309 » The metamathematics of random graphs |
132
click to vote
TAMC
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
123
click to vote
DCOSS
2006
Springer
15 years 5 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
110
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
110
click to vote
CN
2008
15 years 1 months ago
2008
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
131
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...