搜索结果: 1-6 共查到“应用数学 matching”相关记录6条 . 查询时间(0.12 秒)
We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial. In particular, ...
In this paper we study the generalized version of weighted matching in bipartite networks. Consider a weighted matching in a bipartite network in which the nodes derive value from the split of the ma...
A* Orthogonal Matching Pursuit: Best-First Search for Compressed Sensing Signal Recovery
compressed sensing best-first search A* search matching pursuit sparse representations sparse signal
2010/11/29
Compressed sensing is a recently developing area which is interested in reconstruction of sparse signals acquired in reduced dimensions. Acquiring the data with a small number of samples makes the rec...
Many communication channels with discrete input have non-uniform capacity achieving probability mass functions (PMF). By parsing a stream of independent and equiprobable bits according to a full prefi...
Furthermore, we show that error output of single input single output system can be estimated over a certain class of input functions.
On the Eigenvalue Two and Matching Number of a Tree
Tree Laplacian eigenvalues matching number
2007/12/11
In [6], Guo and Tan have shown that $2$ is a Laplacianeigenvalue of any tree with perfect matchings. For trees withoutperfect matchings, we study whether $2$ is one of its Laplacianeigenvalues. If th...