Abstract. Typical analytical measures in graph theory like degree centrality, betweenness and closeness centralities are very common and have long history of their successful use. ...
Abstract— In this paper, we present a novel universal approach which consists in exploring statistics in the compressed frequency domain. This approach is motivated by two main c...
Johann Barbier, Eric Filiol, Kichenakoumar Mayoura
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreve...
A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic e...