Sciweavers

3008 search results - page 407 / 602
» Independence in connected graphs
Sort
View
JMIV
2006
161views more  JMIV 2006»
15 years 6 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
ARSCOM
2002
69views more  ARSCOM 2002»
15 years 6 months ago
On Deuber's partition theorem for (m, p, c)-sets
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
David S. Gunderson
RSA
2008
89views more  RSA 2008»
15 years 6 months ago
Simple permutations mix even better
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask how many randomly selected simple permutations need be composed to...
Alex Brodsky, Shlomo Hoory
RSA
2008
80views more  RSA 2008»
15 years 6 months ago
A spectral technique for random satisfiable 3CNF formulas
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
Abraham Flaxman
CORR
2010
Springer
228views Education» more  CORR 2010»
15 years 5 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb