Concept

Voter registration

Publications associées (9)

Robust Sparse Voting

Rachid Guerraoui, Youssef Allouah, Oscar Jean Olivier Villemaud, Le Nguyen Hoang

Many applications, such as content moderation and recommendation, require reviewing and scoring a large number of alternatives. Doing so robustly is however very challenging. Indeed, voters' inputs are inevitably sparse: most alternatives are only scored b ...

2024

TRIP: Trustless Coercion-Resistant In-Person Voter Registration

Bryan Alexander Ford, Verónica del Carmen Estrada Galiñanes, Louis-Henri Manuel Jakob Merino, Simone Maria Stefano Colombo, Jeffrey Richard Allen

Most existing remote electronic voting systems are vulnerable to voter coercion and vote buying. While coercion-resistant voting systems address this challenge, current schemes assume that the voter has access to an untappable, incorruptible device during ...

2022

The probability of intransitivity in dice and close elections

Jan Hazla

We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for n-sided dice with pairwise ordering induced by the probability, relative to 1/2, that a throw from one die is higher than the other. We ...

2020

Identity and Personhood in Digital Democracy: Evaluating Inclusion, Equality, Security, and Privacy in Pseudonym Parties and Other Proofs of Personhood

Bryan Alexander Ford

Digital identity seems at first like a prerequisite for digital democracy: how can we ensure “one person, one vote” online without identifying voters? But the full gamut of digital identity solutions – e.g., online ID checking, biometrics, self-sovereign i ...

2020

Percolation and Internet Science

Emanuele Massaro

Percolation, in its most general interpretation, refers to the “flow” of something (a physical agent, data or information) in a network, possibly accompanied by some nonlinear dynamical processes on the network nodes (sometimes denoted reaction–diffusion s ...

2019

Registration with the Point Cloud Library A Modular Framework for Aligning in 3-D

Alexandru Eugen Ichim

The open-source point cloud library (PCL) and the tools available for point cloud registration is presented. Pairwise registration is usually carried out by means of one of the several variants of the ICP algorithm. Due to the nonconvexity of the optimizat ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Fault-Tolerance and Reliability of Post-CMOS Systems: a Circuit Perspective

Alexandre Schmid, Yusuf Leblebici, Milos Stanisavljevic

The reliability of systems made of unreliable nanoelectronic devices is discussed in this paper. Massive defect density which may affect future fabrication technologies calls for novel solutions, where spatial redundancy and the voting scheme play a signif ...

IEEE Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

On the dependability of nanoscale circuits and systems

Milos Stanisavljevic

The invention of the integrated circuit and the manufacturing progress as well as continuing progress in the manufacturing process are the fundamental engines for the implementation of all technologies that support today's information society. The vast maj ...

EPFL2009

A Strategy Based on Maximum Spanning Trees to Stitch Together Microscope Images

Michaël Unser, Philippe Thévenaz

Assembling partial views is an attractive means to extend the field of view of microscope images. In this paper, we propose a semi-automated solution to achieve this goal. Its intended audience is the microscopist who desires to scan a large area while acq ...

SPIE2006

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search