Change Detection using multi-temporal satellite images of same area is an established as well as actively pursued research problem. Most of the change detection techniques use algebraic or transform methods to do a pixel by pixel comparison of change detection. These techniques heavily depend upon the correct choice of threshold value to segregate the real changed pixels from the apparent chang...

Although manipulation and bribery have been extensively studied under weighted voting, there has been almost no work done on election control under weighted voting. This is unfortunate, since weighted voting appears in many important natural settings. In this paper, we study the complexity of controlling the outcome of weighted elections through adding and deleting voters. We obtain polynomial-...

An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational complexity of false-name manipulation in weighted voting games which are an important class of coalitional voting games. Weighted voting games have received increased interest in the multiagent community due to their compac...

We work with a recently proposed algorithm where an ensemble of base classifiers, combined using weighted majority voting, is used for incremental classification of data. To successfully accommodate novel information without compromising previously acquired knowledge this algorithm requires an adequate strategy to determine the voting weights. Given an instance to classify, we propose to define...

This paper presents a patch-based approach for pose estimation from single images using a kernelized density voting scheme. We introduce a boostinglike algorithm that models the density using a mixture of weighted ‘weak’ estimators. The ‘weak’ density estimators and corresponding weights are learned iteratively from a training set, providing an efficient method for feature selection. Given a qu...

While voting systems were originally used in political science, they are now also of central importance in various areas of computer science, such as artificial intelligence (in particular within multiagent systems). Brams and Sanver [BS06] introduced sincere-strategy preference-based approval voting (SP-AV) and fallback voting (FV), two election systems which combine the preference rankings of...

Weighted voting is the commonly used strategy for combining predictions in pairwise classification. Even though it shows good classification performance in practice, it is often criticized for lacking a sound theoretical justification. In this paper, we study the problem of combining predictions within a formal framework of label ranking and, under some model assumptions, derive a generalized v...

We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the weighted cutsize of a random spanning tree of the graph. The cutsize is induced by the unknown adversarial labeling of the graph nodes. In deriving our characterization, we obtain a simple randomized algorithm achieving the optimal mistake bound on any graph...

In a weighted voting game, each voter has given weight, and coalition of voters is successful if the sum their individual weights exceeds quota. Such systems translate idea that are not all equal by assigning them different weights. such situation, two symmetric in game interchanging leaves outcome unchanged. Two with same weight naturally every but converse statement necessarily true. We call ...