1060 search results - page 115 / 212 » On the Discovery of Random Trees |
164
click to vote
CCGRID
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
203
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—This paper focuses on the Internet IP-level routing topology and proposes relevant explanations to its apparent dynamics. We first represent this topology as a power-law random...
163
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followe...
160
click to vote
COCOON
2001
Springer
15 years 10 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
143
click to vote
ESA
1995
Springer
15 years 10 months ago
1995
Springer
We present a poly-log-competitive deterministic online algorithm for the online transportation problem on hierarchically separated trees when the online algorithm has one extra se...