CPC
2011
13 years 6 months ago
2011
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
CPC
2011
13 years 6 months ago
2011
Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertices in V . We study the correlation between the events {a → s} and {s → b}. We show that...
CPC
2011
13 years 6 months ago
2011
Let X be the random variable that counts the number of triangles in the binomial random graph G(n, p). We show that for some positive constant c, the probability that X deviates f...
CPC
2011
13 years 6 months ago
2011
CPC
2011
13 years 6 months ago
2011
CORR
2011
Springer
2011
Springer
Iterative Reweighted Algorithms for Sparse Signal Recovery with Temporally Correlated Source Vectors
13 years 6 months ago
Iterative reweighted algorithms, as a class of algorithms for sparse signal recovery, have been found to have better performance than their non-reweighted counterparts. However, f...
CORR
2011
Springer
13 years 6 months ago
2011
Springer
CORR
2011
Springer
13 years 6 months ago
2011
Springer
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
CORR
2011
Springer
13 years 6 months ago
2011
Springer
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
CORR
2011
Springer
13 years 6 months ago
2011
Springer
