Results 1  10
of
4,601
On Directional Immunization and Exact Matching
"... Abstract The rigorous version of Redington's theorem by Montrucchio and Peccati [12] is shown to be valid in a multivariate framework. It provides necessary and sufficient conditions for immunizing a fixedincome portfolio of assets and liabilities against a fixed nonparallel shift direction ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
direction of the term structure of interest rates. As a consequence, immunization against all possible shift directions leads necessarily to an exact matching strategy. Mathematics Subject Classification: 62P05, 91B82, 91G30
Almost exact matchings
, 2007
"... In the exact matching problem we are given a graph G, some of whose edges are coloredr ed, and a positive integer k. The goal is to determine if G has a perfect matching, exactly k edges of which are red. More generally if the matching number of G is m = m(G), the goal is to find a matching with m e ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In the exact matching problem we are given a graph G, some of whose edges are coloredr ed, and a positive integer k. The goal is to determine if G has a perfect matching, exactly k edges of which are red. More generally if the matching number of G is m = m(G), the goal is to find a matching with m
Exact matching in image databases
 In Proceedings of the 2001 IEEE International Conference on Multi media and Expo (ICME2001
"... We believe there is a niche for exact subimage searching in image databases. When only a subimage is searched for, traditional image searching approaches fail because the subimage features usually represent only a small fraction of the global image features. Said differently: it is difficult to f ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We believe there is a niche for exact subimage searching in image databases. When only a subimage is searched for, traditional image searching approaches fail because the subimage features usually represent only a small fraction of the global image features. Said differently: it is difficult
Compression for Exact Match Identification
"... Abstract—In this paper, we consider the problem of determining whether sequences X and Y, generated i.i.d. according to PX × PY, are equal given access only to the pair (Y,T(X)), where T(X) is a rateR compressed version of X. In general, the rate R may not be sufficiently large to reliably determin ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—In this paper, we consider the problem of determining whether sequences X and Y, generated i.i.d. according to PX × PY, are equal given access only to the pair (Y,T(X)), where T(X) is a rateR compressed version of X. In general, the rate R may not be sufficiently large to reliably determine whether X = Y. We precisely characterize this reliability – i.e., the exponential rate at which an error is made – as a function of R. Interestingly, the exponent turns out to be related to the Bhattacharyya distance between the distributions PX and PY. In addition, the scheme achieving this exponent is universal, i.e. does not depend on PX,PY. I.
cem: Coarsened Exact Matching in Stata
, 2010
"... new method for improving the estimation of causal effects by reducing imbalance in covariates between treated and control groups. CEM is faster, easier to use and understand, requires fewer assumptions, more easily automated, and possesses more attractive statistical properties for many applications ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
applications than existing matching methods. In CEM, users temporarily coarsen their data, exact match on these coarsened data, then run their analysis on the uncoarsened, matched data. CEM bounds the degree of model dependence and causal effect estimation error by ex ante user choice, is montonic imbalance
Extracting Maximal Exact Matches on GPU
"... Abstract—The revolution in highthroughput sequencing technologies accelerated the discovery and extraction of various genomic sequences. However, the massive size of the generated datasets raise several computational problems. For example, aligning the sequences or finding the similar regions in th ..."
Abstract
 Add to MetaCart
in them, which is one of the crucial steps in many bioinformatics pipelines, is a time consuming task. Maximal exact matches have been considered important to detect and evaluate the similarity. Most of the existing tools that are designed and developed to find the maximal matches are based on advanced
POINTCLOUD REFINEMENT VIA EXACT MATCHING
"... In many multiview stereo (MVS) algorithms, a pointcloud evolution is performed, based on the matching process. For most of them, an assumption is usually employed for the matching, which indicates that the matching windows have the same shape. This assumption lays a great limit to the quality of t ..."
Abstract
 Add to MetaCart
of the reconstructed result. To improve the pointcloud obtained from other algorithms, and break the limit laid by the regular matching, we propose our refinement method using exact matching. The exact matching enables more accurate matching windows for the points, by taking the normal vector into consideration
Exact Matching: Preprocessing Pattern(s) KnuthMorrisPratt AhoCorasick
"... exact matching: topics exact matching search pattern P in text T (P,T strings) ..."
Abstract
 Add to MetaCart
exact matching: topics exact matching search pattern P in text T (P,T strings)
Novel Method for Improving the Exact Matching of the Molecular Graphs
"... Abstract — one way of determining chemical and biological reactivity of a newly found compound is by searching database for structurally similar molecules. Graph theory concepts are being used for molecular matching. Molecular matching is of two kinds, like, complete matching and partial matching (l ..."
Abstract
 Add to MetaCart
molecules. Then exact matching with the query molecule is performed through fine filtering on the remaining molecules in order to find the exact match for the query molecule from the pruned database using more expensive graph isomorphism algorithm. In this way search time can be reduced significantly. I.
Results 1  10
of
4,601