Sciweavers

1818 search results - page 346 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
WADS
2009
Springer
232views Algorithms» more  WADS 2009»
14 years 3 months ago
On Making Directed Graphs Transitive
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 ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...
COCOON
2009
Springer
14 years 3 months ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch
DCOSS
2009
Springer
14 years 3 months ago
Finding Symbolic Bug Patterns in Sensor Networks
Abstract. This paper presents a failure diagnosis algorithm for summarizing and generalizing patterns that lead to instances of anomalous behavior in sensor networks. Often multipl...
Mohammad Maifi Hasan Khan, Tarek F. Abdelzaher, Ji...
IFIP
2009
Springer
14 years 3 months ago
Trusted Multiplexing of Cryptographic Protocols
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
Jay A. McCarthy, Shriram Krishnamurthi