5 accepted papers
Domain shift, which occurs when there is a mismatch between the distributions of training (source) and testing (target) datasets, usually results in poor performance of the trained model on the target domain. Existing algorithms typically solve this issue by reducing the distribution discrepancy in…
Graph-structured data arise in wide applications, such as computer vision, bioinformatics, and social networks. Quantifying similarities among graphs is a fundamental problem. In this paper, we develop a framework for computing graph kernels, based on return probabilities of random walks. The advant…
We investigate the problem of direction of arrival (DOA) estimation using sparse linear arrays, such as co-prime and nested arrays, in the case of missing data resulting from sensor failures. We introduce a signal model where sensor failures occur after taking certain number of snapshots. We formula…
In this paper, we provide a novel regression algorithm based on a Gaussian random field (GRF) indexed by a Riemannian manifold (M, g). We utilize both the labeled and unlabeled data sets to exploit the geometric structure of M. We use the recovered heat (H) kernel as the covariance function for the…
Sparse linear arrays, such as co-prime and nested arrays, can identify up to O(M <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) sources with only O(M) sensors by using co-array based MUSIC. We conduct analytical performance analysis of two co…