2638 search results - page 125 / 528 » Random Geometric Complexes |
160
click to vote
SODA
2000
ACM
15 years 6 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
115
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
137
click to vote
NC
2007
15 years 4 months ago
2007
Abstract. We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an in...
117
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
156
click to vote
IPTPS
2003
Springer
15 years 9 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...