Currently the best algorithms for transcription factor binding site prediction are severely limited in accuracy. There is good reason to believe that predictions from these different classes of algorithms could be used in conjunction to improve the quality of predictions. In previous work, we have applied single layer networks, rules sets and support vector machines on predictions from key real...

Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting weight vote in favour of or against a decision. A coalition of agents is winning if and only if the sum of weights of the coalition exceeds or equals a specified...

Since the existing floating car map-matching algorithms lead to high error rate when GPS data sampling rate is low, we propose a global-voting map matching algorithm. Based on floating car GPS track data, the algorithm do not only consider the influence to matching process caused by the topological information of road network but also the different spatial distance of GPS track data. In this ma...

This paper proposes an approach to improve statistical word alignment with ensemble methods. Two ensemble methods are investigated: bagging and cross-validation committees. On these two methods, both weighted voting and unweighted voting are compared under the word alignment task. In addition, we analyze the effect of different sizes of training sets on the bagging method. Experimental results ...

Despite the popularity and empirical success of patch-based nearest-neighbor and weighted majority voting approaches to medical image segmentation, there has been no theoretical development on when, why, and how well these nonparametric methods work. We bridge this gap by providing a theoretical performance guarantee for nearest-neighbor and weighted majority voting segmentation under a new pro...

A proposal in a weighted voting game is accepted if the sum of the (non-negative) weights of the “yea” voters is at least as large as a given quota. Several authors have considered representations of weighted voting games with minimum sum, where the weights and the quota are restricted to be integers. In [Freixas and Molinero(2009)] the authors have classified all weighted voting games without ...

Mobile and loosely-coupled environments call for decentralized optimistic replication protocols that provide highly available access to shared objects. A fundamental property of most optimistic protocols is to guarantee an eventual consensus on a commit order among the set of tentatively issued updates. In this paper we propose a replicated object protocol that employs a novel epidemic weighted...

The Shapley-Shubik, Banzhaf, and Deegan-Packel indices are three prominent power indices for measuring voters’ power in weighted voting games. We consider two methods of manipulating weighted voting games, called annexation and merging. These manipulations allow either an agent, called an annexer to take over the voting weights of some other agents, or the coming together of some agents to form...