2283 search results - page 138 / 457 » Bounds of Graph Characteristics |
CIE
2006
Springer
13 years 12 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
VTS
2006
IEEE
14 years 2 months ago
2006
IEEE
A new algorithm for identifying stuck faults in combinational circuits that cannot be detected by a given input sequence is presented. Other than pre and post-processing steps, ce...
FM
2009
Springer
14 years 23 days ago
2009
Springer
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this ...
FM
2008
Springer
13 years 9 months ago
2008
Springer
We focus on synthesis techniques for transforming existing fault-intolerant real-time programs to fault-tolerant programs that provide phased recovery. A fault-tolerant program is ...
UAI
2004
13 years 9 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...