Sciweavers

1302 search results - page 59 / 261
» On the Strong Chromatic Number
Sort
View
FSTTCS
2007
Springer
16 years 16 days ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
ECBS
2002
IEEE
118views Hardware» more  ECBS 2002»
15 years 11 months ago
On the Relation between Design Contracts and Errors: A Software Development Strategy
When designing a software module or system, a systems engineer must consider and differentiate between how the system responds to external and internal errors. External errors can...
Eivind J. Nordby, Martin Blom, Anna Brunstrom
FLAIRS
2007
15 years 8 months ago
Introductory AI for Both Computer Science and Neuroscience Students
Macalester College offers a single undergraduate elective in artificial intelligence. This course is cross-listed between Computer Science and Cognitive and Neuroscience Studies,...
Susan Eileen Fox
CORR
2006
Springer
85views Education» more  CORR 2006»
15 years 6 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil
ICICS
2009
Springer
16 years 28 days ago
Design of Reliable and Secure Multipliers by Multilinear Arithmetic Codes
Abstract. We propose an efficient technique for the detection of errors in cryptographic circuits introduced by strong adversaries. Previously a number of linear and nonlinear err...
Zhen Wang, Mark G. Karpovsky, Berk Sunar, Ajay Jos...