Browse State-of-the-Art › Distributed Voting

Distributed Voting

0 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28

Benchmarks archive 2025-07-28

No benchmark for this task in the archive.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

No dataset record in the archive lists this task.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Parent tasks archive 2025-07-28

Papers archive 2025-07-28

archive papers tagged: 2 · with a code link: 0 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 2 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 2 of 2, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.

  • VALUE: Large Scale Voting-based Automatic Labelling for Urban Environments
    5 Jun 2020 0 repositories listed
    This paper presents a simple and robust method for the automatic localisation of static 3D objects in large-scale urban environments.
  • Distributed Voting/Ranking with Optimal Number of States per Node
    26 Mar 2017 0 repositories listed
    Considering a network with n nodes, where each node initially votes for one (or more) choices out of K possible choices, we present a Distributed Multi-choice Voting/Ranking (DMVR) algorithm to determine either the…

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections