• No results found

maximum matching

English-Chinese Name Transliteration with Bi-Directional Syllable-Based Maximum Matching

English-Chinese Name Transliteration with Bi-Directional Syllable-Based Maximum Matching

... Forward Maximum Matching and Backward Maximum Matching respectively, using the different ...Forward Maximum Matching and “B” for Backward Maximum Matching, “1/2/5” ...

9

The Matching Equivalence Graphs with the Maximum Matching Root Less than or Equal to 2

The Matching Equivalence Graphs with the Maximum Matching Root Less than or Equal to 2

... the maximum root of φ ( G x , ) denoted by ρ ( ) G ( ρ ( ) G is also called spectral radius of graph G), ...the maximum matching root less than or equal to 2, we firstly give some useful lemmas as ...

7

English Chinese Personal Name Transliteration by Syllable Based Maximum Matching

English Chinese Personal Name Transliteration by Syllable Based Maximum Matching

... the former is often restricted to the end of a name. This would not be realised for now, unless a longer segment can be matched, e.g. “VELO” could only be matched on single syllables, so “夫 洛” (fu1 luo4) came before “维洛” ...

5

Solving the Maximum Matching Problem on Bipartite Star123 Free Graphs in Linear Time

Solving the Maximum Matching Problem on Bipartite Star123 Free Graphs in Linear Time

... A matching M of a graph G = ( V E , ) is a subset of edges with the property that no two edges of M share a common ...A matching is called induced if the subgraph of G induced by M consists of exactly M ...

12

Deterministic Word Segmentation Using Maximum Matching with Fully Lexicalized Rules

Deterministic Word Segmentation Using Maximum Matching with Fully Lexicalized Rules

... Note that the form of the left hand side of the rule is the sequence of characters, not the sequence of words. Due to this simplification, we can combine dictionary lookup by maximum matching with ex- ...

5

Deterministic fully dynamic data structures for vertex cover and matching

Deterministic fully dynamic data structures for vertex cover and matching

... for maximum matching appears to be a particularly difficult task: in this case, an update bound of O(poly log(n)) would be a breakthrough, since it would immediately improve the longstanding bounds of ...

43

Automatic Evaluation of Landmarks for Image-Based Navigation Update

Automatic Evaluation of Landmarks for Image-Based Navigation Update

... for maximum allowed translation and rotation ...and maximum grid points with a value one are used in the evaluation of the landmarks, ...maximal matching distance which is required for the path ...

10

Secure   and  Oblivious  Maximum  Bipartite  Matching  Size  Algorithm  with  Applications  to  Secure  Fingerprint  Identification

Secure and Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification

... privacy-preserving matching of two fingerprints (used for secure fingerprint authentication or identification) using traditional minutia-based representation of fingerprints that leads to the most discriminative ...

24

A FORMAL DEFINITION OF METRICS FOR OBJECT ORIENTED DESIGN: MOOD METRICS

A FORMAL DEFINITION OF METRICS FOR OBJECT ORIENTED DESIGN: MOOD METRICS

... The rest of this paper is organized as follows. Section 2 gives a brief overview of previous work of Chinese text segmentation. Section 3 introduces the maximum matching and frequency statistics ...

8

From matchings to independent sets

From matchings to independent sets

... In 1965, Jack Edmonds proposed his celebrated polynomial-time solution to the maximum matching problem, which is equivalent to the maximum independent set problem restricted to the class of line ...

21

Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) update time

Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) update time

... and maximum matching in O(log n/δ 2 )-amortized update ...tional matching and vertex ...fractional matching), and a fixing procedure maintains various ...

15

THE INDEPENDENT TRANSVERSAL PAIRED DOMINATION IN GRAPHS

THE INDEPENDENT TRANSVERSAL PAIRED DOMINATION IN GRAPHS

... the maximum matching of 𝐺 is always an independent transversal paired dominating set of 𝐺, such partition exists for all graphs except for the complete graphs of odd order so that asking the maximum ...

15

Total Edge Dominating Functions of Corona Product Graph of a Cycle with a Complete Graph

Total Edge Dominating Functions of Corona Product Graph of a Cycle with a Complete Graph

... and maximum matching cardinality are characterized by Dutton and Klostermeyer [9] while Yannakakis and Gavril [17] have shown that edge dominating set problem is NP complete even when restricted to planar ...

5

Clustering analysis of microRNA and mRNA expression data from TCGA using maximum edge-weighted matching algorithms

Clustering analysis of microRNA and mRNA expression data from TCGA using maximum edge-weighted matching algorithms

... a maximum weighted merger method (MWMM) ap- proach combining the Hungarian algorithm and blossom al- gorithm was used to passively cluster the miRNA-mRNA pairs using the maximum weighted edge ...

27

Live C  elegans Diffraction at a Single Point

Live C elegans Diffraction at a Single Point

... central maximum, p = 0, will not vary as the frequency inside the cosine term (Equation (4)) equals ...tral maximum increases the frequency range increases matching the increments of the fundamental ...

8

On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching

On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching

... in social networks, vertices may correspond to people and edges to friendships between them (Carrington et al., 2005; Yang and Leskovec, 2015); in computer vision, vertices may represent pixels in an image and edges may ...

34

Evaluating treatment effectiveness under model misspecification: A comparison of targeted maximum likelihood estimation with bias-corrected matching

Evaluating treatment effectiveness under model misspecification: A comparison of targeted maximum likelihood estimation with bias-corrected matching

... where the (potentially heterogeneous) individual level treatment effects are marginalised over the distribution of W The consistency assumption states that an individual’s potential outcome under the observed treatment is ...

23

Evaluating treatment effectiveness under model misspecification: a comparison of targeted maximum likelihood estimation with bias corrected matching

Evaluating treatment effectiveness under model misspecification: a comparison of targeted maximum likelihood estimation with bias corrected matching

... Our work extends the previous literature in several aspects. First, this is the first paper that compares the relative performance of BCM and TMLE, and also compares these methods to traditional approaches. Second, while ...

24

Directivity Optimization in Planar Sub-Arrayed Monopulse Antenna

Directivity Optimization in Planar Sub-Arrayed Monopulse Antenna

... In this paper, a two-stage procedure for the optimization of the directivity of compromise difference patterns in monopulse planar sub-arrayed antennas has been considered. The CPM has been used to define the “best ...

7

Discussion Measurement Models and Algorithms of the Wind Vector Field Based on Satellite Images

Discussion Measurement Models and Algorithms of the Wind Vector Field Based on Satellite Images

... establish matching model for the clouds image. Maximum correlation coefficient between the target modules and tracking module is obtained by using infrared brightness temperature cross- correlation ...

5

Show all 10000 documents...

Related subjects