Sciweavers

12193 search results - page 321 / 2439
» It's not all about
Sort
View
137
Voted
CCR
2008
62views more  CCR 2008»
15 years 6 months ago
Promoting tolerance for delay tolerant network research
So what is all this DTN research about anyway? Sceptics ask: "Why are there no DTN applications?", or "Why is DTN performance so miserable?" This article attem...
Jon Crowcroft, Eiko Yoneki, Pan Hui, Tristan Hende...
IJAHUC
2008
83views more  IJAHUC 2008»
15 years 6 months ago
Connectivity of a Gaussian network
: Following Etherington, Hoge and Parkes, we consider a network consisting of (approximately) N transceivers in the plane R2 distributed randomly with density given by a Gaussian d...
Paul N. Balister, Béla Bollobás, Ami...
JCT
2008
100views more  JCT 2008»
15 years 6 months ago
Optimal distortion embeddings of distance regular graphs into Euclidean spaces
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...
Frank Vallentin
158
Voted
JDA
2008
85views more  JDA 2008»
15 years 6 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
184
Voted
DAM
2007
82views more  DAM 2007»
15 years 6 months ago
Every toroidal graph without adjacent triangles is (4, 1)*-choosable
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
Baogang Xu, Haihui Zhang