806 search results - page 60 / 162 » Lower Bounds on Correction Networks |
145
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during the...
156
click to vote
ITA
2000
15 years 6 months ago
2000
We consider the multiparty communication model de ned in 4] using the formalism from 8]. First, we correct an inaccuracy in the proof of the fundamental result of 6] providing a lo...
182
Voted
APN
2010
Springer
15 years 4 months ago
2010
Springer
Workflow mining is the task of automatically producing a workflow model from a set of event logs recording sequences of workflow events; each sequence corresponds to a use case or ...
175
Voted
PODC
2006
ACM
16 years 2 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
166
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Motivated by random linear network coding, we study the communication through channels, called linear operator channels (LOCs), that perform linear operation over finite fields. Fo...