5100 search results - page 893 / 1020 » The Linear Complexity of a Graph |
119
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
165
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them ...
151
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
This paper presents a hierarchical Bayesian model to reconstruct sparse images when the observations are obtained from linear transformations and corrupted by an additive white Gau...
153
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are asso...
143
click to vote
CVIU
2008
15 years 5 months ago
2008
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...