• No results found

bipartite matching-based technique

A Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs

A Novel Symbolic Algorithm for Maximum Weighted Matching in Bipartite Graphs

... weighted matching in bipartite graphs is one of typical combinatorial optimization pro- blems, where the size of graphs is a significant and often prohibitive ...manipulation technique, called as ...

11

The Symbolic OBDD Algorithm for Finding Optimal Semi matching in Bipartite Graphs

The Symbolic OBDD Algorithm for Finding Optimal Semi matching in Bipartite Graphs

... in bipartite graphs is one of typical combinatorial optimization problems, where the size of graphs is a significant and often pro- hibitive ...manipulation technique, called as symbolic graph algorithm or ...

8

CBIR MD/BGP: CBIR MD System based on Bipartite Graph Partitioning

CBIR MD/BGP: CBIR MD System based on Bipartite Graph Partitioning

... The proposed system CBIR-MD/BGP image is an enhancement of our previous research work [33] in terms of bipartite graph partitioning and integrated image matching technique. In this system, image is ...

10

Generalized Matching Preclusion in Bipartite Graphs

Generalized Matching Preclusion in Bipartite Graphs

... perfect matching in a graph is a set of edges such that every vertex is incident with exactly one edge in this ...perfect matching, then it has an even number of ...The matching preclusion number of ...

18

Detection of Lung Cancer Using Digital Image Processing Techniques: A Comparative Study

Detection of Lung Cancer Using Digital Image Processing Techniques: A Comparative Study

... template matching technique based on genetic algorithm(GA) template matching (GATM)for detecting nodules existing in lung area, for Computer- Aided Diagnosis (CAD) systems to detect lung ...

5

Pairing Wikipedia Articles Across Languages

Pairing Wikipedia Articles Across Languages

... Wikipedia has become a reference knowledge source for scores of NLP applications. One of its invaluable features lies in its multilingual nature, where articles on a same entity or concept can have from one to more than ...

5

Integrated Ontology for Agricultural Domain

Integrated Ontology for Agricultural Domain

... applied on the agricultural domain for faba bean crop to get a dynamic integrated ontology, it can be applied also on all crops. This system uses Multi-Matching and Merging Algorithm (MMMA) to get the integrated ...

8

Necessary & Sufficient Conditions for Consistency of Haar Wavelet Expressions to their resizable Hadoop Cluster Channels and Complexity

Necessary & Sufficient Conditions for Consistency of Haar Wavelet Expressions to their resizable Hadoop Cluster Channels and Complexity

... the bipartite matching rectangular array of Haar Wavelet expressions is that it extends in a straightforward way to the multi-cloud ...a bipartite matching rectangular array of Haar Wavelet ...

18

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

... maximum matching problem was introduced by Berge in [16]. Let M be any matching of a graph G = ( V E , ) , an M-alternating path is a path whose edges are alternately in M and in E − M ...

12

Counting Objects using Convolution based Pattern Matching Technique

Counting Objects using Convolution based Pattern Matching Technique

... Correlation-based methods have been used extensively for a variety of applications such as motion analysis [5, 12], object recognition [1], face detection [8, 15], printed characters, industrial inspections of ...

6

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

... The bipartite graphs with equal edge domination number and maximum matching cardinality are characterized by Dutton and Klostermeyer [9] while Yannakakis and Gavril [17] have shown that edge dominating set ...

5

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 ...

24

Frame Comparison Using Structural Similarity For
Fixed Threshold

Frame Comparison Using Structural Similarity For Fixed Threshold

... There are different ways to select key frame. Triangle model of perceived energy is one of them. The frames are the edge cutting point of the motion speeding up and motion speeding down in selected frames. Features like ...

7

Code clone detection using string based tree matching technique

Code clone detection using string based tree matching technique

... CODE CLONE DETECTION USING STRING BASED STRING BASED TREE MATCHING TECHNIOUE.. Contains confidential information under the Official Secret Act 1972*.[r] ...

24

A Novel Content-Based Image Retrieval Technique Using Tree Matching

A Novel Content-Based Image Retrieval Technique Using Tree Matching

... This paper proposes a combination of histogram method and region based CBIR systems to define a new image object’s relationships based on the image graph. The proposed algorithm, segments images, computes ...

5

Enhanced Face Matching Technique based on SURF and Neural Network

Enhanced Face Matching Technique based on SURF and Neural Network

... Hossein Sahoolizadeh, Zargham Heidari and Hamid Dehghani in 2013examined a strategy by Combining of PCA and LDA. The ability of LDA is enhanced when few examples of images are utilized and neural classifier is utilized ...

6

Randomised techniques in combinatorial algorithmics

Randomised techniques in combinatorial algorithmics

... In the second part of the chapter, we describe a probabilistic technique which can be use- ful in approximating the threshold function of several combinatorial problems. Roughly speaking sometimes the ...

151

Proposed Heuristic Method for Solving Assignment Problems

Proposed Heuristic Method for Solving Assignment Problems

... a bipartite graph made up of two partitions V and U , and a set of weighted edges E between the two par- titions, the problem requires the selection of a subset of the edges with a maximum sum of weights such that ...

6

On sets not belonging to algebras and rainbow matchings in graphs

On sets not belonging to algebras and rainbow matchings in graphs

... Whenever it is clear from the context, we omit writing with respect to which matching a switching is defined. The length of σ is denoted by `(σ). Furthermore, we denote by m(σ) the set of all edges of σ that are ...

9

Frequency Based Indexing Technique for Pattern Matching

Frequency Based Indexing Technique for Pattern Matching

... queries based on the LIKE ‘%...%’ search even if the table is indexed based on the column being searched ...queries based on the LIKE ...queries based on LIKE ‘%...%’ operator (or pattern ...

6

Show all 10000 documents...

Related subjects