3247 search results - page 484 / 650 » Randomized smoothing networks |
190
click to vote
ALGOSENSORS
2007
Springer
16 years 18 days ago
2007
Springer
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
161
click to vote
ISAAC
2007
Springer
16 years 17 days ago
2007
Springer
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
173
click to vote
INFOCOM
2006
IEEE
16 years 13 days ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
160
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
171
click to vote
WS
2005
ACM
15 years 12 months ago
2005
ACM
The pervasiveness of wireless devices and the architectural organization of wireless networks in distributed communities, where no notion of trust can be assumed, are the main rea...