Sciweavers

332 search results - page 61 / 67
» Complexity analysis of a decentralised graph colouring algor...
Sort
View
EUROPAR
2010
Springer
13 years 8 months ago
cTrust: Trust Aggregation in Cyclic Mobile Ad Hoc Networks
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...
Huanyu Zhao, Xin Yang, Xiaolin Li
DATAMINE
2010
175views more  DATAMINE 2010»
13 years 7 months ago
Extracting influential nodes on a social network for information diffusion
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...
Masahiro Kimura, Kazumi Saito, Ryohei Nakano, Hiro...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 8 months ago
Better extractors for better codes?
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...
Venkatesan Guruswami
SPAA
2003
ACM
14 years 26 days ago
Information gathering in adversarial systems: lines and cycles
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...
Kishore Kothapalli, Christian Scheideler
BMCBI
2008
121views more  BMCBI 2008»
13 years 7 months ago
GeneTrailExpress: a web-based pipeline for the statistical evaluation of microarray experiments
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...
Andreas Keller, Christina Backes, Maher Al-Awadhi,...