332 search results - page 61 / 67 » Complexity analysis of a decentralised graph colouring algor... |
108
click to vote
EUROPAR
2010
Springer
15 years 21 days ago
2010
Springer
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
124
click to vote
DATAMINE
2010
14 years 11 months ago
2010
We address the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models...
STOC
2004
ACM
15 years 12 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
89
Voted
SPAA
2003
ACM
15 years 4 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
91
Voted
BMCBI
2008
14 years 11 months ago
2008
Background: High-throughput methods that allow for measuring the expression of thousands of genes or proteins simultaneously have opened new avenues for studying biochemical proce...