779 search results - page 63 / 156 » Algorithms for the Sample Mean of Graphs |
149
click to vote
ECML
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we consider latent variable models and introduce a new U-likelihood concept for estimating the distribution over hidden variables. One can derive an estimat...
148
click to vote
AEI
1999
15 years 4 months ago
1999
Multihop lightwave networks are a means of utilizing the large bandwidth of optical fibers. In these networks, each node has a fixed number of transmitters and receivers connected...
214
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
In evolutionary computation, experimental results are commonly analyzed using an algorithmic performance metric called best-so-far. While best-so-far can be a useful metric, its u...
177
click to vote
CSDA
2011
14 years 11 months ago
2011
Motivated by the application of seismic inversion in the petroleum industry we consider a hidden Markov model with two hidden layers. The bottom layer is a Markov chain and given ...
157
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Due to multipath delay spread and relatively high sampling rate in OFDM systems, the channel estimation is formulated as a sparse recovery problem, where a hybrid compressed sensi...