Publications related to Nondeterministic algorithm

Randomized versus Deterministic Implementations of Concurrent Data Structures

One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed overmulti ...

EPFL2012

Deterministic algorithm for the cooperative data exchange problem

Michael Christoph Gastpar, Sameer Pawar

Download Citation Email Print Request Permissions Save to Project In this paper we study the problem of data exchange, where each node in the system has a number of linear combinations of the data packets. Communicating over a public channel, the goal is f ...

IEEE2011

Competitive ratio of List Scheduling on uniform machines and randomized heuristics

Antoine Musitelli, Jean-Marc Nicoletti

We study online scheduling on m uniform machines, where m - 1 of them have a reference speed 1 and the last one a speed s with 0

Springer US2011

Graph-based classification of multiple observation sets

Pascal Frossard, Effrosyni Kokiopoulou

We consider the problem of classification of multiple observations of the same object, possibly under different transformations. We view this problem as a special case of semi-supervised learning where all unlabelled examples belong to the same unknown cla ...

Elsevier2010

Sorting signed permutations by inversions in O(nlogn) time

Bernard Moret, Yu Lin, Vaibhav Rajan, Krister Swenson

The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...

2010

Model checking transactional memories

Rachid Guerraoui, Vasu Singh

Model checking transactional memories (TMs) is difficult because of the unbounded number, length, and delay of concurrent transactions, as well as the unbounded size of the memory. We show that, under certain conditions satisfied by most TMs we know of, th ...

Springer Verlag2010

A Leader-Free Byzantine Consensus Algorithm

André Schiper, Fatemeh Borran

The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorithms that solve consensus with Byzantine faults are leader-based. This is not ...

Springer-Verlag2010

A Leader-Free Byzantine Consensus Algorithm

André Schiper, Fatemeh Borran

The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorithms that solve consensus with Byzantine faults are leader-based. This is not ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Multi-Target Tracking Of Packed Yeast Cells

Michaël Unser, Sebastian Maerkl, Ricard Delgado Gonzalo, Nicolas Dénervaud

The tracking of cell populations in time-lapse microscopy images enables high-throughput spatiotemporal measurements of cell dynamics. In this paper, we present a new algorithm to simultaneously track many cells in crowded areas. The algorithm runs in real ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Multi-Target Tracking of Packed Yeast Cells

Michaël Unser, Ricard Delgado Gonzalo

The tracking of cell populations in time-lapse microscopy images enables high-throughput spatiotemporal measurements of cell dynamics. In this paper, we present a new algorithm to simultaneously track many cells in crowded areas. The algorithm runs in rea ...

IEEE2010

Nondeterministic algorithm

Graph Chatbot

Chat with Graph Search

Randomized versus Deterministic Implementations of Concurrent Data Structures

Deterministic algorithm for the cooperative data exchange problem

Competitive ratio of List Scheduling on uniform machines and randomized heuristics

Graph-based classification of multiple observation sets

Sorting signed permutations by inversions in O(nlogn) time

Model checking transactional memories

A Leader-Free Byzantine Consensus Algorithm

A Leader-Free Byzantine Consensus Algorithm

Multi-Target Tracking Of Packed Yeast Cells

Multi-Target Tracking of Packed Yeast Cells

Competitive ratio of List Scheduling on uniform machines and randomized heuristics

Randomized versus Deterministic Implementations of Concurrent Data Structures

Model checking transactional memories

A Leader-Free Byzantine Consensus Algorithm

A Leader-Free Byzantine Consensus Algorithm

Deterministic algorithm for the cooperative data exchange problem

Multi-Target Tracking Of Packed Yeast Cells

Graph-based classification of multiple observation sets

Multi-Target Tracking of Packed Yeast Cells

Sorting signed permutations by inversions in O(nlogn) time