搜索结果: 1-15 共查到“数学 matching”相关记录23条 . 查询时间(0.221 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Job Matching with Interventions: Constraints, Subsidy, and Taxation
工作匹配 替代条件 市场均衡
2023/4/18
In markets for indivisible resources such as workers and objects, subsidy and taxation for an agent may depend on the set of acquired resources and prices. This paper investigates how such transfer po...
Why We Can Not Surpass Capacity: The Matching Condition
Iterations coding system coding binary input
2015/8/21
We show that iterative coding systems can not surpass capacity using only quantities which naturally appear in density evolution. Although the result in itself
is trivial, the method which we apply s...
Sparse Solution of Underdetermined Linear Equations by Stagewise Orthogonal Matching Pursuit
compressed sensing decoding error-correcting codes
2015/8/21
Finding the sparsest solution to underdetermined systems of linear equations y = Φx is NP-hard
in general. We show here that for systems with ‘typical’/‘random’ Φ, a good approximation to the
sparse...
Random Matrices, Magic Squares and Matching Polynomials
Random matrix the rubik's cube matching polynomial
2015/7/8
Random Matrices, Magic Squares and Matching Polynomials。
Matching markers and unlabeled configurations in protein gels
Electrophoresis shape Western Blots.
2012/11/23
Unlabeled shape analysis is a rapidly emerging and challenging area of statistics. This has been driven by various novel applications in bioinformatics. We consider here the situation where two config...
A Domain Decomposition Method with Lagrange Multiplier Based on the Pointwise Matching Condition
domain decomposition nonmatching grids pointwise matching error estimate
2012/8/8
A Domain Decomposition Method with Lagrange Multiplier Based on the Pointwise Matching Condition。
Orthogonal Matching Pursuit with Noisy and Missing Data: Low and High Dimensional Results
Orthogonal Matching Pursuit Noisy and Missing Data High Dimensional Results Statistics Theory
2012/6/21
Many models for sparse regression typically assume that the covariates are known completely, and without noise. Particularly in high-dimensional applications, this is often not the case. This paper de...
Target Identification Using Dictionary Matching of Generalized Polarization Tensors
generalized polarization tensors target identification shape representation stability analysis
2012/4/16
The aim of this paper is to provide a fast and efficient procedure for (real-time) target identification in imaging based on matching on a dictionary of precomputed generalized polarization tensors (G...
The size of a hypergraph and its matching number
hypergraph its matching number Combinatorics
2011/9/22
Abstract: More than forty years ago, Erd\H{o}s conjectured that for any T <= N/K, every K-uniform hypergraph on N vertices without T disjoint edges has at most max{\binom{KT-1}{K}, \binom{N}{K} - \bin...
On a Greedy 2-Matching Algorithm and Hamilton Cycles in Random Graphs with Minimum Degree at Least Three
Greedy 2-Matching Algorithm Hamilton Cycles Random Graphs Minimum Degree
2011/9/20
Abstract: We describe and analyse a simple greedy algorithm \2G\ that finds a good 2-matching $M$ in the random graph $G=G_{n,cn}^{\d\geq 3}$ when $c\geq 15$. A 2-matching is a spanning subgraph of ma...
Non-commutative Hodge structures: Towards matching categorical and geometric examples
Non-commutative Hodge structures matching categorical geometric examples Algebraic Geometry
2011/9/9
Abstract: The subject of the present work is the "de Rham part" of non-commutative Hodge structures on the periodic cyclic homology of differential graded algebras and categories. We discuss explicit ...
A boundary matching micro/macro decomposition for kinetic equations
boundary matching micro/macro decomposition kinetic equations
2011/1/21
We introduce a new micro/macro decomposition of collisional kinetic equations which naturally incorporates the exact space boundary conditions.
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, ...
Matching Statistics of an Itô Process by a Process of Diffusion Type
Matching Statistics Process of Diffusion Type
2010/11/8
Suppose we are given a multi-dimensional It\^o process, which can be regarded as a model for an underlying asset price together with related stochastic processes, e.g., volatility. The drift and diff...
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...