1282 search results - page 21 / 257 » Algorithms for Large, Sparse Network Alignment Problems |
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Co-clustering can be viewed as a two-way (bilinear) factorization of a large data matrix into dense/uniform and possibly overlapping submatrix factors (co-clusters). This combinat...
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— This paper considers the basis vector selection issue invloved in forward selection algorithms to sparse Gaussian Process Regression (GPR). Firstly, we re-examine a pre...
JSAC
2008
13 years 7 months ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...