13457 search results - page 14 / 2692 » Can we elect if we cannot compare |
BMCBI
2005
13 years 7 months ago
2005
Background: Normalization is the process of removing non-biological sources of variation between array experiments. Recent investigations of data in gene expression databases for ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
DAS
2010
Springer
13 years 10 months ago
2010
Springer
We consider the problem of dealing with irrelevant votes when a multi-case classifier is built from an ensemble of binary classifiers. We show how run-off elections can be used to...
TC
1998
13 years 7 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...