Relevant bibliographies by topics / Computer matching

Academic literature on the topic 'Computer matching'

Author: Grafiati
Published: 4 June 2021
Last updated: 19 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Computer matching.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Computer matching"

1

OSUMI, Masayuki. "Computer Color Matching System." Journal of the Japan Society of Colour Material 80, no. 12 (2007): 530–36. http://dx.doi.org/10.4011/shikizai1937.80.530.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

CUTLER, A. E. "A New Colour-matching Computer." Journal of the Society of Dyers and Colourists 81, no. 12 (October 22, 2008): 601–8. http://dx.doi.org/10.1111/j.1478-4408.1965.tb02636.x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

CHENG, EDDIE, RANDY JIA, and DAVID LU. "MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES." Journal of Interconnection Networks 11, no. 01n02 (March 2010): 35–60. http://dx.doi.org/10.1142/s0219265910002726.

Full text
Abstract:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those incident to a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those incident to a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. In this paper, we find this number and classify all optimal sets for the augmented cubes, a class of networks designed as an improvement of the hypercubes.
APA, Harvard, Vancouver, ISO, and other styles
4

MAO, YAPING, and EDDIE CHENG. "A Concise Survey of Matching Preclusion in Interconnection Networks." Journal of Interconnection Networks 19, no. 03 (September 2019): 1940006. http://dx.doi.org/10.1142/s0219265919400061.

Full text
Abstract:
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. There are other related parameters and generalization including the strong matching preclusion number, the conditional matching preclusion number, the fractional matching preclusion number, and so on. In this survey, we give an introduction on the general topic of matching preclusion.
APA, Harvard, Vancouver, ISO, and other styles
5

LÜ, HUAZHONG, and TINGZENG WU. "Fractional Matching Preclusion for Restricted Hypercube-Like Graphs." Journal of Interconnection Networks 19, no. 03 (September 2019): 1940010. http://dx.doi.org/10.1142/s0219265919400103.

Full text
Abstract:
The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the graph with neither perfect matchings nor almost perfect matchings. The fractional perfect matching preclusion and fractional strong perfect matching preclusion are generalizations of the matching preclusion. In this paper, we obtain fractional matching preclusion number and fractional strong matching preclusion number of restricted hypercube-like graphs, which extend some known results.
APA, Harvard, Vancouver, ISO, and other styles
6

CHENG, EDDIE, DAVID LU, and BRIAN XU. "STRONG MATCHING PRECLUSION OF PANCAKE GRAPHS." Journal of Interconnection Networks 14, no. 02 (June 2013): 1350007. http://dx.doi.org/10.1142/s0219265913500072.

Full text
Abstract:
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. In this paper, we examine the properties of pancake graphs by finding its strong matching preclusion number and categorizing all optimal solutions.
APA, Harvard, Vancouver, ISO, and other styles
7

Chen, Ciping. "Matchings and matching extensions in graphs." Discrete Mathematics 186, no. 1-3 (May 1998): 95–103. http://dx.doi.org/10.1016/s0012-365x(97)00182-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

WEI, XIAQI, SHURONG ZHANG, and WEIHUA YANG. "Matching Preclusion for Enhanced Pyramid Networks." Journal of Interconnection Networks 19, no. 03 (September 2019): 1940009. http://dx.doi.org/10.1142/s0219265919400097.

Full text
Abstract:
The matching preclusion number of a graph is the minimum number of edges whose deletion leaves the resulting graph that has neither perfect matchings nor almost perfect matchings. This concept was introduced as a measure of robustness in the event of edge failure in interconnection networks. The pyramid network is one of the important networks applied in parallel and distributed computer systems. Chen et al. in 2004 proposed a new hierarchy structure, called the enhanced pyramid network, by replacing each mesh in a pyramid network with a torus. An enhanced pyramid network of n layers is denoted by EPM(n). In this paper, we prove that the matching preclusion number of EPM(n) is 9 where n ≥ 4.
APA, Harvard, Vancouver, ISO, and other styles
9

Oh, Won-suk, John Pogoncheff, and William J. O’Brien. "Digital Computer Matching of Tooth Color." Materials 3, no. 6 (June 18, 2010): 3694–99. http://dx.doi.org/10.3390/ma3063694.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Fysh, Matthew C., and Markus Bindemann. "Human-Computer Interaction in Face Matching." Cognitive Science 42, no. 5 (June 28, 2018): 1714–32. http://dx.doi.org/10.1111/cogs.12633.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Computer matching"

1

Tam, Siu-lung. "Linear-size indexes for approximate pattern matching and dictionary matching." Click to view the E-thesis via HKUTO, 2010. http://sunzi.lib.hku.hk/hkuto/record/B44205326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tam, Siu-lung, and 譚小龍. "Linear-size indexes for approximate pattern matching and dictionary matching." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B44205326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Campbell, Neill William. "Template matching and optimisation in computer vision." Thesis, University of Bristol, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.295176.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

O'Malley, Gregg. "Algorithmic aspects of stable matching problems." Thesis, University of Glasgow, 2007. http://theses.gla.ac.uk/64/.

Full text
Abstract:
The Stable Marriage problem (SM), the Hospitals/Residents problem (HR) and the Stable Roommates problem (SR) are three classical stable matching problems that were first studied by Gale and Shapley in 1962. These problems have widespread practical application in centralised automated matching schemes, which assign applicants to posts based on preference lists and capacity constraints in both the UK and internationally. Within such schemes it is often the case that an agent's preference list may be incomplete, and agents may also be allowed to express indifference in the form of ties. In the presence of ties, three stability criteria can be defined, namely weak stability, strong stability and super-stability. In this thesis we consider stable matching problems from an algorithmic point of view. Some of the problems that we consider are derived from new stable matching models, whilst others are obtained from existing stable matching models involving ties and incomplete lists, with additional natural restrictions on the problem instance. Furthermore, we also explore the use of constraint programming with both SM and HR. We first study a new variant of the Student-Project Allocation problem in which each student ranks a set of acceptable projects in preference order and similarly each lecturer ranks his available projects in preference order. In this context, two stability definitions can be identified, namely weak stability and strong stability. We show that the problem of finding a maximum weakly stable matching is NP-hard. However, we describe two 2-approximation algorithms for this problem. Regarding strong stability, we describe a polynomial-time algorithm for finding such a matching or reporting that none exists. Next we investigate SM with ties and incomplete lists (SMTI), and HR with ties (HRT), where the length of each agent's list is subject to an upper bound. We present both polynomial-time algorithms and NP-hardness results for a range of problems that are derived from imposing upper bounds on the length of the lists on one or both sides. We also consider HRT, and SR with ties and incomplete lists (SRTI), where the preference lists of one or both sets of agents (as applicable) are derived from one or two master lists in which agents are ranked. For super-stability, in the case of each of HRT and SRTI with a master list, we describe a linear-time algorithm that simplifies the algorithm used in the general case. In the case of strong stability, for each of HRT and SRTI with a master list, we describe an algorithm that is faster than that for the general case. We also show that, given an instance I of SRTI with a master list, the problem of finding a weakly stable matching is polynomial-time solvable. However, we show that given such an I, the problem of finding a maximum weakly stable matching is NP-hard. Other new stable matching models that we study are the variants of SMTI and SRTI with symmetric preferences. In this context we consider two models that are derived from alternative ways of interpreting the rank of an agent in the presence of ties. For both models we show that deciding if a complete weakly stable matching exists is NP-complete. Then for one of the models we show that each of the problem of finding a minimum regret and an egalitarian weakly stable matching is NP-hard and that the problem of determining if a (man,woman) pair belongs to a weakly stable matching is NP-complete. We then describe algorithms for each of the problems of finding a super-stable matching and a strongly stable matching, or reporting that none exists, given instances of SRTI and HRT with symmetric preferences (regardless of how the ranks are interpreted). Finally, we use constraint programming techniques to model instances of SM and HR. We describe two encodings of SM in terms of a constraint satisfaction problem. The first model for SM is then extended to the case of HR. This encoding for HR is then extended to create a model for HRT under weak stability. Using this encoding we can obtain, with the aid of search, all the weakly stable matchings, given an instance of HRT.
APA, Harvard, Vancouver, ISO, and other styles
5

Abrahamson, Jeff Shokoufandeh Ali. "Optimal matching and deterministic sampling /." Philadelphia, Pa. : Drexel University, 2007. http://hdl.handle.net/1860/2526.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Christmas, W. J. "Structural matching in computer vision using probabilistic reasoning." Thesis, University of Surrey, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.308472.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kwon, Ohkyu. "Similarity measures for object matching in computer vision." Thesis, University of Bolton, 2016. http://ubir.bolton.ac.uk/890/.

Full text
Abstract:
The similarity measures for object matching and their applications have been important topics in many fields of computer vision such as those of image recognition, image fusion, image analysis, video sequence matching, and so on. This critical commentary presents the efficiency of new metric methods such as the robust Hausdorff distance (RHD), the accurate M-Hausdorff distance (AMHD), and the fast sum of absolute differences (FSAD). The RHD measure computes the similarity distance of the occluded/noisy image pair and evaluates the performances of the multi-modal registration algorithms. The AMHD measure is utilised for aligning the pair of the occluded/noisy multi-sensor face images, and the FSAD measure in adaptive-template matching method finds the zero location of the slide in an automatic scanning microscope system. A Hausdorff distance (HD) similarity measure has been widely investigated to compare the pair of two-dimensional (2-D) images by low-level features since it is simple and insensitive to the changes in an image characteristic. In this research, novel HD measures based on the robust statistics of regression analysis are addressed for occluded and noisy object matching, resulting in two RHD measures such as M-HD based on the M-estimation and LTS-HD based on the least trimmed squares (LTS). The M-HD is extended to three-dimensional (3-D) version for scoring the registration algorithms of the multi-modal medical images. This 3-D measure yields the comparison results with different outlier-suppression parameters (OSP) quantitatively, even though the Computed Tomography (CT) and emission-Positron Emission Tomography (PET) images have different distinctive features. The RHD matching technique requires a high level of complexity in computing the minimum distance from one point to the nearest point between two edge point sets and searching for the best fit of matching position. To overcome these problems, the improved 3×3 distance transform (DT) is employed. It has a separable scan structure to reduce the calculation time of the minimum distance in multi-core processors. The object matching algorithm with hierarchical structures is also demonstrated to minimize the computational complexity dramatically without failing the matching position. The object comparison between different modality images is still challenging due to the poor edge correspondence coming from heterogeneous characteristics. To improve the robustness of HD measures in comparing the pair of multi-modal sensor images, an accurate M-HD (AMHD) is proposed by utilizing the orientation information of each point in addition to the DT map. This similarity measure can precisely analyse the non-correspondent edges and noises by using the distance orientation information. The AMHD measure yields superior performance at aligning the pairs of multi-modal face images over those achieved by the conventional robust HD schemes. The sum of absolute differences (SAD) is popular similarity measure in template matching technique. This thesis shows the adaptive-template matching method based on the FSAD for accurately locating the slide in automated microscope. The adaptive-template matching method detects the fiduciary ring mark in the slide by predicting the constant used in the template, where the FSAD reduces the processing time with a low rate of error of the template matching by inducing 1-D vertical and horizontal SAD. The proposed scheme results in an accurate performance in terms of detecting the ring mark and estimating the relative offset in slide alignment during the on-line calibration process.
APA, Harvard, Vancouver, ISO, and other styles
8

Jin, Wei. "GRAPH PATTERN MATCHING, APPROXIMATE MATCHING AND DYNAMIC GRAPH INDEXING." Case Western Reserve University School of Graduate Studies / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=case1307547974.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

McDermid, Eric J. "A structural approach to matching problems with preferences." Thesis, University of Glasgow, 2011. http://theses.gla.ac.uk/2371/.

Full text
Abstract:
This thesis is a study of a number of matching problems that seek to match together pairs or groups of agents subject to the preferences of some or all of the agents. We present a number of new algorithmic results for five specific problem domains. Each of these results is derived with the aid of some structural properties implicitly embedded in the problem. We begin by describing an approximation algorithm for the problem of finding a maximum stable matching for an instance of the stable marriage problem with ties and incomplete lists (MAX-SMTI). Our polynomial time approximation algorithm provides a performance guarantee of 3/2 for the general version of MAX-SMTI, improving upon the previous best approximation algorithm, which gave a performance guarantee of 5/3. Next, we study the sex-equal stable marriage problem (SESM). We show that SESM is W[1]-hard, even if the men's and women's preference lists are both of length at most three. This improves upon the previously known hardness results. We contrast this with an exact, low-order exponential time algorithm. This is the first non-trivial exponential time algorithm known for this problem, or indeed for any hard stable matching problem. Turning our attention to the hospitals / residents problem with couples (HRC), we show that HRC is NP-complete, even if very severe restrictions are placed on the input. By contrast, we give a linear-time algorithm to find a stable matching with couples (or report that none exists) when stability is defined in terms of the classical Gale-Shapley concept. This result represents the most general polynomial time solvable restriction of HRC that we are aware of. We then explore the three dimensional stable matching problem (3DSM), in which we seek to find stable matchings across three sets of agents, rather than two (as in the classical case). We show that under two natural definitions of stability, finding a stable matching for a 3DSM instance is NP-complete. These hardness results resolve some open questions in the literature. Finally, we study the popular matching problem (POP-M) in the context of matching a set of applicants to a set of posts. We provide a characterization of the set of popular matchings for an arbitrary POP-M instance in terms of a new structure called the switching graph exploited to yield efficient algorithms for a range of associated problems, extending and improving upon the previously best-known results for this problem.
APA, Harvard, Vancouver, ISO, and other styles
10

Unsworth, Chris. "A specialised constraint approach for stable matching problems." Thesis, University of Glasgow, 2008. http://theses.gla.ac.uk/467/.

Full text
Abstract:
Constraint programming is a generalised framework designed to solve combinatorial problems. This framework is made up of a set of predefined independent components and generalised algorithms. This is a very versatile structure which allows for a variety of rich combinatorial problems to be represented and solved relatively easily. Stable matching problems consist of a set of participants wishing to be matched into pairs or groups in a stable manner. A matching is said to be stable if there is no pair or group of participants that would rather make a private arrangement to improve their situation and thus undermine the matching. There are many important "real life" applications of stable matching problems across the world. Some of which includes the Hospitals/Residents problem in which a set of graduating medical students, also known as residents, need to be assigned to hospital posts. Some authorities assign children to schools as a stable matching problem. Many other such problems are also tackled as stable matching problems. A number of classical stable matching problems have efficient specialised algorithmic solutions. Constraint programming solutions to stable matching problems have been investigated in the past. These solutions have been able to match the theoretically optimal time complexities of the algorithmic solutions. However, empirical evidence has shown that in reality these constraint solutions run significantly slower than the specialised algorithmic solutions. Furthermore, their memory requirements prohibit them from solving problems which the specialised algorithmic solutions can solve in a fraction of a second. My contribution investigates the possibility of modelling stable matching problems as specialised constraints. The motivation behind this approach was to find solutions to these problems which maintain the versatility of the constraint solutions, whilst significantly reducing the performance gap between constraint and specialised algorithmic solutions. To this end specialised constraint solutions have been developed for the stable marriage problem and the Hospitals/Residents problem. Empirical evidence has been presented which shows that these solutions can solve significantly larger problems than previously published constraint solutions. For these larger problem instances it was seen that the specialised constraint solutions came within a factor of four of the time required by algorithmic solutions. It has also been shown that, through further specialisation, these constraint solutions can be made to run significantly faster. However, these improvements came at the cost of versatility. As a demonstration of the versatility of these solutions it is shown that, by adding simple side constraints, richer problems can be easily modelled. These richer problems add additional criteria and/or an optimisation requirement to the original stable matching problems. Many of these problems have been proven to be NP-Hard and some have no known algorithmic solutions. Included with these models are results from empirical studies which show that these are indeed feasible solutions to the richer problems. Results from the studies also provide some insight into the structure of these problems, some of which have had little or no previous study.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Computer matching"

1

Vosselman, G. Relational matching. Berlin: Springer-Verlag, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lisbach, Bertrand. Linguistic Identity Matching. Wiesbaden: Springer Fachmedien Wiesbaden, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Uncertain schema matching. San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA): Morgan & Claypool, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pauw, Guy de. Probabilistische parsers: Contextgevoeligheid en pattern-matching. Antwerpen: Universiteit Antwerpen, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Template matching techniques in computer vision: Theory and practice. Chichester, West Sussex, U.K: Wiley, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Townsend, George Victor James. Citation matching in the Oxford English Dictionary. Waterloo, Ont: UW Centre for the New Oxford English Dictionary, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chiprout, Eli. Asymptotic Waveform Evaluation: And Moment Matching for Interconnect Analysis. Boston, MA: Springer US, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Park, James. A practical introduction to computer matching in the dyeing industry. Leicester: Dymatecs Ltd, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Abdelmalek, Nabih N. A computer vision system for matching 3-D range data objects. Ottawa, Ont: National Research Council Canada, Division of Electrical Engineering, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lee, Raymond Shu Tak. Invariant object recognition based on elastic graph matching: Theory and applications. Amsterdam: IOS Press, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Computer matching"

1

Goldberg, Leslie Ann, Paul W. Goldberg, Cynthia A. Phillips, and Gregory B. Sorkin. "Constructing computer virus phylogenies." In Combinatorial Pattern Matching, 253–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61258-0_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Erciyes, K. "Matching." In Texts in Computer Science, 263–303. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-73235-0_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Erciyes, K. "Matching." In Computer Communications and Networks, 173–91. London: Springer London, 2013. http://dx.doi.org/10.1007/978-1-4471-5173-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Weik, Martin H. "matching." In Computer Science and Communications Dictionary, 983. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_11157.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Tuytelaars, Tinne. "Wide Baseline Matching." In Computer Vision, 1–4. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-03243-2_191-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tuytelaars, Tinne. "Wide Baseline Matching." In Computer Vision, 888–91. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-0-387-31439-6_191.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Allen, Peter K. "Matching." In The Kluwer International Series in Engineering and Computer Science, 95–108. Boston, MA: Springer US, 1987. http://dx.doi.org/10.1007/978-1-4613-2005-0_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chli, Margarita, and Andrew J. Davison. "Active Matching." In Lecture Notes in Computer Science, 72–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-88682-2_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Weik, Martin H. "rule matching." In Computer Science and Communications Dictionary, 1509. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_16544.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Weik, Martin H. "pattern-matching." In Computer Science and Communications Dictionary, 1240. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_13732.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Computer matching"

1

Bacso, Gabor, Anita Keszler, and Zsolt Tuza. "Matching Matchings." In 2013 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems (ECBS-EERC). IEEE, 2013. http://dx.doi.org/10.1109/ecbs-eerc.2013.19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tavani, Herman T. "Computer matching and personal privacy." In the symposium. New York, New York, USA: ACM Press, 1996. http://dx.doi.org/10.1145/238339.238379.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kolbl, O., Karin de Laporte, D. Gasior, and A. S. Walker. "Multitemplate matching: a sensitive matching algorithm." In Spatial Information from Digital Photogrammetry and Computer Vision: ISPRS Commission III Symposium, edited by Heinrich Ebner, Christian Heipke, and Konrad Eder. SPIE, 1994. http://dx.doi.org/10.1117/12.182873.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lind, R. H., O. Allottai, A. M. Gaaim, and H. Almuallim. "Computer Assisted History Matching - A Field Example." In SPE Reservoir Characterization and Simulation Conference and Exhibition. Society of Petroleum Engineers, 2013. http://dx.doi.org/10.2118/165979-ms.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

V. Krymskaya, M., R. G. Hanea, J. D. Jansen, and A. W. Heemink. "Observation Sensitivity in Computer-assisted History Matching." In 72nd EAGE Conference and Exhibition incorporating SPE EUROPEC 2010. European Association of Geoscientists & Engineers, 2010. http://dx.doi.org/10.3997/2214-4609.201400961.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Abrahem, Fathe Suliman, Zoltan E. Heinemann, and Georg Martin Abrahem. "A New Computer Assisted History Matching Method." In SPE EUROPEC/EAGE Annual Conference and Exhibition. Society of Petroleum Engineers, 2010. http://dx.doi.org/10.2118/130426-ms.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Guilfoyle, Peter S., Pericles A. Mitkas, and P. B. Berra. "Digital optoelectronic computer for textual pattern matching." In Hybrid Image and Signal Processing II, edited by David P. Casasent and Andrew G. Tescher. SPIE, 1990. http://dx.doi.org/10.1117/12.21306.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jain, Anil K., Jianjiang Feng, Abhishek Nagar, and Karthik Nandakumar. "On matching latent fingerprints." In 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPR Workshops). IEEE, 2008. http://dx.doi.org/10.1109/cvprw.2008.4563117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Caetano, Tiberio S., Li Cheng, Quoc V. Le, and Alex J. Smola. "Learning Graph Matching." In 2007 IEEE 11th International Conference on Computer Vision. IEEE, 2007. http://dx.doi.org/10.1109/iccv.2007.4408838.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chai, Dengfeng, and Qunsheng Peng. "Bilayer Stereo Matching." In 2007 IEEE 11th International Conference on Computer Vision. IEEE, 2007. http://dx.doi.org/10.1109/iccv.2007.4408999.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Computer matching"

1

Zheng S. and J. M. Brennan. Computer Aided Design of Stub Tuners for Impedance Matching. Office of Scientific and Technical Information (OSTI), September 2003. http://dx.doi.org/10.2172/1061699.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Computer matching' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography