نتایج جستجو برای: matching process

تعداد نتایج: 1399144  

2014
Risheng Han Shigen Shen Guangxue Yue Hui Ding

A novel BA complex network model of color space is proposed based on two fundamental rules of BA scale-free network model: growth and preferential attachment. The scale-free characteristic of color space is discovered by analyzing evolving process of template's color distribution. And then the template's BA complex network model can be used to select important color pixels which have much large...

2002
Adel Hlaoui Shengrui Wang

The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact graph matching is the process of finding the best possible matching between two graphs when exact matching is impossible. In this paper, we propose a new algorithm for the inexact matching problem. The new algorithm dec...

2006
Janne Koljonen Jarmo T. Alander

Fuzzy image pattern matching recognizes and localizes objects in images using methods of fuzzy logic. The methods use fuzzy segmentation, templates and operators that bring a heap of alternatives into the reasoning process. Fuzzy pattern matching takes into account uncertainties and inaccuracies of the input images as well as the template images and incorporates them in the matching process. In...

Journal: :International Journal of Artificial Intelligence and Machine Learning 2021

Journal: :Petroleum Exploration and Development 2023

This paper proposes a methodology for an alternative history matching process enhanced by the incorporation of simplified binary interpretation reservoir saturation logs (RST) as objective function. Incorporating fluids during phase unlocks possibility to adjust or select models that better represent near wellbore waterfront movement, which is particularly important uncertainty mitigation futur...

2006
Gernot Veit Batz

Subgraph matching (aka graph pattern matching or the subgraph isomorphism problem) is NP-complete. But in practice subgraph matching should be performed in reasonable time if possible. In this work a heuristically optimizing approach to subgraph matching on labeled graphs is described. It relies on the fact that the runtime of the matching process can vary significantly for different matching s...

2014
Sojen Pradhan Valérie Gay Surya Nepal

Nowadays, healthcare recommendation systems are matching health professionals with patients based on preferences such as location, type of treatments, price, availability or other information including their type of health insurance. In the health social network domain, subjective criteria such as attitude, personality and behaviour have not been considered for matching of patients and health p...

2014
Keqiang Liu Zhiqiang Yan Yuquan Wang Lijie Wen Jianmin Wang

Nowadays, business process management plays an important role in the management of organizations. More and more organizations describe their operations as business processes It is common for organizations to have collections of thousands of business process models. The same process is usually modeled differently due to the different rules or habits of different organizations and departments. Ev...

2007
Marko Banek Boris Vrdoljak A Min Tjoa Zoran Skocir

A federated data warehouse is a logical integration of data warehouses applicable when physical integration is impossible due to privacy policy or legal restrictions. In order to enable the translation of queries in a federated approach, schemas of the federated and the local warehouses must be matched. In this paper we present a procedure that enables the matching process for schema structures...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید