Sciweavers

458 search results - page 9 / 92
» Totally magic graphs
Sort
View
UAI
2008
15 years 1 months ago
On Identifying Total Effects in the Presence of Latent Variables and Selection bias
Assume that cause-effect relationships between variables can be described as a directed acyclic graph and the corresponding linear structural equation model We consider the identi...
Manabu Kuroki, Zhihong Cai
JMIV
2006
161views more  JMIV 2006»
14 years 11 months ago
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization
This paper deals with the total variation minimization problem in image restoration for convex data fidelityfunctionals.Weproposeanewandfastalgorithmwhichcomputesanexactsolutionint...
Jérôme Darbon, Marc Sigelle
GC
2008
Springer
14 years 11 months ago
A Bijection for Eulerian-equivalence Classes of Totally Cyclic Orientations
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
Beifang Chen, Arthur L. B. Yang, Terence Y. J. Zha...
APAL
2011
14 years 6 months ago
The provably total NP search problems of weak second order bounded arithmetic
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...
DM
2007
125views more  DM 2007»
14 years 11 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze