181 search results - page 26 / 37 » On the Number of Errors Correctable with Codes on Graphs |
IH
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
WADS
2009
Springer
14 years 1 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
CAV
2010
Springer
2010
Springer
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
13 years 8 months ago
Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of op...
ESAS
2007
Springer
14 years 27 days ago
2007
Springer
Location information can be used to enhance mutual entity authentication protocols in wireless ad-hoc networks. More specifically, distance bounding protocols have been introduced...
MCS
2007
Springer
14 years 26 days ago
2007
Springer
Selecting the optimal number of features in a classifier ensemble normally requires a validation set or cross-validation techniques. In this paper, feature ranking is combined with...