Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Psaromiligkos, Ioannis N."'
It is inconceivable how chaotic the world would look to humans, faced with innumerable decisions a day to be made under uncertainty, had they been lacking the capacity to distinguish the relevant from the irrelevant---a capacity which computationally
Externí odkaz:
http://arxiv.org/abs/1801.10186
The Frame Problem (FP) is a puzzle in philosophy of mind and epistemology, articulated by the Stanford Encyclopedia of Philosophy as follows: "How do we account for our apparent ability to make decisions on the basis only of what is relevant to an on
Externí odkaz:
http://arxiv.org/abs/1701.08100
Humans routinely confront the following key question which could be viewed as a probabilistic variant of the controllability problem: While faced with an uncertain environment governed by causal structures, how should they practice their autonomy by
Externí odkaz:
http://arxiv.org/abs/1512.01885
Multi-Context Models for Reasoning under Partial Knowledge: Generative Process and Inference Grammar
Arriving at the complete probabilistic knowledge of a domain, i.e., learning how all variables interact, is indeed a demanding task. In reality, settings often arise for which an individual merely possesses partial knowledge of the domain, and yet, i
Externí odkaz:
http://arxiv.org/abs/1412.4271
In this paper, we address the problem of how a network of agents can collaboratively fit a linear model when each agent only ever has an arbitrary summand of the regression data. This problem generalizes previously studied data-matrix-splitting scena
Externí odkaz:
http://arxiv.org/abs/1408.1073
We propose an expectation maximization (EM)-based algorithm for semi-blind channel estimation of reciprocal channels in amplify-and-forward (AF) two-way relay networks (TWRNs). By incorporating both data samples and pilots into the estimation, the pr
Externí odkaz:
http://arxiv.org/abs/1304.6617
In this paper, we derive for the first time the exact Cramer-Rao bounds (CRBs) on semi-blind channel estimation for amplify-and-forward two-way relay networks. The bounds cover a wide range of modulation schemes that satisfy a certain symmetry condit
Externí odkaz:
http://arxiv.org/abs/1207.5483
A lower bound for the Gaussian Q-function is presented in the form of a single exponential function with parametric order and weight. We prove the lower bound by introducing two functions, one related to the Q-function and the other similarly related
Externí odkaz:
http://arxiv.org/abs/1202.6483
We consider the problem of channel estimation for amplify-and-forward two-way relays assuming channel reciprocity and M-PSK modulation. In an earlier work, a partially-blind maximum-likelihood estimator was derived by treating the data as determinist
Externí odkaz:
http://arxiv.org/abs/1202.3468
We analyze the mean-squared error (MSE) performance of widely linear (WL) and conventional subspace-based channel estimation for single-input multiple-output (SIMO) flat-fading channels employing binary phase-shift-keying (BPSK) modulation when the c
Externí odkaz:
http://arxiv.org/abs/1106.2994