1511 search results - page 30 / 303 » Randomness, lowness and degrees |
ISCC
2005
IEEE
15 years 5 months ago
2005
IEEE
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
ICNS
2009
IEEE
15 years 6 months ago
2009
IEEE
What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is ...
102
click to vote
JCT
2007
14 years 11 months ago
2007
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...
MICCAI
2008
Springer
16 years 29 days ago
2008
Springer
Nonrigid registration of contrast-enhanced MR images is a difficult problem due to the change in pixel intensity caused by the washin and wash-out of the contrast agent. In this pa...
ISPAN
2005
IEEE
15 years 5 months ago
2005
IEEE
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...