ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
The paper contains comparisons of lower bound (potential) and achieved efficiency for filtering grayscale and color images corrupted by AWGN. It is demonstrated that for complex s...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
Considering a two-way amplify-and-forward (AF) relay network and aiming to simultaneously maximize the two users’ mutual information lower bounds in the presence of channel esti...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
TSP
2010
13 years 5 months ago
2010
We compute lower bounds on the mean-square error of multiple change-point estimation. In this context, the parameters are discrete and the Cram
TON
2010
13 years 5 months ago
2010
We consider a class of wireless networks with general interference constraints on the set of links that can be served simultaneously at any given time. We restrict the traffic to b...
TIT
2010
13 years 5 months ago
2010
In this paper, a new class of Bayesian lower bounds is proposed. Derivation of the proposed class is performed via projection of each entry of the vector-function to be estimated ...
SIAMCO
2010
13 years 5 months ago
2010
We study a simple continuous-time multiagent system related to Krause's model of opinion dynamics: each agent holds a real value, and this value is continuously attracted by e...
MOC
2010
13 years 5 months ago
2010
Computing a lower bound for the canonical height is a crucial step in determining a Mordell
JCT
2011
13 years 5 months ago
2011
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spann...
EJC
2011
13 years 5 months ago
2011
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...