Log in

Relevant bibliographies by topics / Planar matching

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Planar matching'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Planar 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 "Planar matching"

1

Alt, Helmut, Alon Efrat, Günter Rote, and Carola Wenk. "Matching planar maps." Journal of Algorithms 49, no. 2 (2003): 262–83. http://dx.doi.org/10.1016/s0196-6774(03)00085-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Berman, Fran, David Johnson, Tom Leighton, Peter W. Shor, and Larry Snyder. "Generalized planar matching." Journal of Algorithms 11, no. 2 (1990): 153–84. http://dx.doi.org/10.1016/0196-6774(90)90001-u.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Biedl, Therese, Stefan Huber, and Peter Palfrader. "Planar Matchings for Weighted Straight Skeletons." International Journal of Computational Geometry & Applications 26, no. 03n04 (2016): 211–29. http://dx.doi.org/10.1142/s0218195916600050.

Full text

Abstract:

We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restorati

APA, Harvard, Vancouver, ISO, and other styles

4

Nagao, Kenji, and W. E. L. Grimson. "Affine Matching of Planar Sets." Computer Vision and Image Understanding 70, no. 1 (1998): 1–22. http://dx.doi.org/10.1006/cviu.1998.0623.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Alt, Helmut, Ludmila Scharf, and Daria Schymura. "Probabilistic matching of planar regions." Computational Geometry 43, no. 2 (2010): 99–114. http://dx.doi.org/10.1016/j.comgeo.2009.04.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Aldred, R. E. L., and Michael D. Plummer. "Distance matching in punctured planar triangulations." Journal of Combinatorics 7, no. 2–3 (2016): 509–30. http://dx.doi.org/10.4310/joc.2016.v7.n2.a15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Frankena, H. J., J. de Jong, H. Oltmans, and H. van Brug. "Thickness matching in planar multilayer waveguides." Applied Optics 29, no. 15 (1990): 2320. http://dx.doi.org/10.1364/ao.29.002320.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Pikaz, Arie, and Its'hak Dinstein. "Matching of partially occluded planar curves." Pattern Recognition 28, no. 2 (1995): 199–209. http://dx.doi.org/10.1016/0031-3203(94)00088-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Aldred, R. E. L., and Michael D. Plummer. "Proximity thresholds for matching extension in planar and projective planar triangulations." Journal of Graph Theory 67, no. 1 (2011): 38–46. http://dx.doi.org/10.1002/jgt.20511.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Aldred, R. E. L., and Michael D. Plummer. "On restricted matching extension in planar graphs." Discrete Mathematics 231, no. 1-3 (2001): 73–79. http://dx.doi.org/10.1016/s0012-365x(00)00305-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Planar matching"

1

Shor, Peter Williston. "Random planar matching and bin packing." Thesis, Massachusetts Institute of Technology, 1985. https://hdl.handle.net/1721.1/128792.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.<br>Bibliography: leaves 123-124.<br>by Peter Williston Shor.<br>Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.

APA, Harvard, Vancouver, ISO, and other styles

2

Scharf, Ludmila [Verfasser]. "Probabilistic matching of planar shapes / Ludmila Scharf." Berlin : Freie Universität Berlin, 2009. http://d-nb.info/1023624923/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Voigt, Konrad. "Structural Graph-based Metamodel Matching." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-81671.

Full text

Abstract:

Data integration has been, and still is, a challenge for applications processing multiple heterogeneous data sources. Across the domains of schemas, ontologies, and metamodels, this imposes the need for mapping specifications, i.e. the task of discovering semantic correspondences between elements. Support for the development of such mappings has been researched, producing matching systems that automatically propose mapping suggestions. However, especially in the context of metamodel matching the result quality of state of the art matching techniques leaves room for improvement. Although the t

APA, Harvard, Vancouver, ISO, and other styles

4

Asathulla, Mudabir Kabir. "A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs." Thesis, Virginia Tech, 2017. http://hdl.handle.net/10919/88080.

Full text

Abstract:

Matching is one of the most fundamental algorithmic graph problems. Many variants of matching problems have been studied on different classes of graphs, the one of special interest to us being the Maximum Cardinality Bipartite Matching in Planar Graphs. In this work, we present a novel sparsification based approach for computing maximum/perfect bipartite matching in planar graphs. The overall complexity of our algorithm is O(n^{6/5} log^2 {n}) where n is the number of vertices in the graph, bettering the O(n^{3/2}) time achieved independently by Hopcroft-Karp algorithm and by Lipton and

APA, Harvard, Vancouver, ISO, and other styles

5

Liang, Bojian. "Matching planar contours and polarimetric analysis of image data." Thesis, Heriot-Watt University, 2002. http://hdl.handle.net/10399/488.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Iwancio, Kathleen Marie. "Use of Integral Signature and Hausdorff Distance in Planar Curve Matching." NCSU, 2009. http://www.lib.ncsu.edu/theses/available/etd-11032009-104907/.

Full text

Abstract:

Curve matching is an important problem in computer image processing and image recognition. In particular, the problem of identifying curves that are equivalent under a geometric transformation arises in a variety of applications. Two curves in $mathbb{R}^2$ are called congruent if they are equivalent under the action of the Euclidean group, i.e. if one curve can be mapped to the other by a combination of rotations, reflections, and translations. In theory, one can identify congruent curves by using differential invariants, such as infinitesimal arc-length and curvature. The practical use of di

APA, Harvard, Vancouver, ISO, and other styles

7

Alibakhshikenari, M., B. S. Virdee, P. Shukla, et al. "Impedance Bandwidth Improvement of a Planar Antenna Based on Metamaterial-Inspired T-Matching Network." IEEE, 2021. http://hdl.handle.net/10454/18486.

Full text

Abstract:

yes<br>In this paper a metamaterial-inspired T-matching network is directly imbedded inside the feedline of a microstrip antenna to realize optimum power transfer between the front-end of an RF wireless transceiver and the antenna. The proposed T-matching network, which is composed of an arrangement of series capacitor, shunt inductor, series capacitor, exhibits left-handed metamaterial characteristics. The matching network is first theoretically modelled to gain insight of its limitations. It was then implemented directly in the 50-Ω feedline to a standard circular patch antenna, which is an

APA, Harvard, Vancouver, ISO, and other styles

8

Giaier, Kevin Stanton. "Designing Shape Changing Mechanisms for Planar and Spatial Applications." University of Dayton / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1418043619.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Rutter, Ignaz [Verfasser], and D. [Akademischer Betreuer] Wagner. "The many faces of planarity : matching, augmentation, and embedding algorithms for planar graphs / Ignaz Rutter. Betreuer: D. Wagner." Karlsruhe : KIT-Bibliothek, 2011. http://d-nb.info/1015557848/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Valba, Olga. "Statistical analysis of networks and biophysical systems of complex architecture." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00919606.

Full text

Abstract:

Complex organization is found in many biological systems. For example, biopolymers could possess very hierarchic structure, which provides their functional peculiarity. Understating such, complex organization allows describing biological phenomena and predicting molecule functions. Besides, we can try to characterize the specific phenomenon by some probabilistic quantities (variances, means, etc), assuming the primary biopolymer structure to be randomly formed according to some statistical distribution. Such a formulation is oriented toward evolutionary problems.Artificially constructed biolog

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Planar matching"

1

R, Brown Jeffrey. 401(k) matching contributions in company stock: Costs and benefits for firms and workers. National Bureau of Economic Research, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Engelhardt, Gary V. Employer matching and 401(k) saving: Evidence from the health and retirement study. National Bureau of Economic Research, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Hackett, Clive. Matching plants and land: Development of a general broadscale system from a crop project for Papua New Guinea. CSIRO, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Minnesota. Legislature. Legislative Commission on Pensions and Retirement. Implications of employer matching contributions to Internal Revenue Code Section 403(b) plans: A report to the Minnesota Legislature mandated by Laws 1994, Chapter 572, Section 12. Legislative Commission on Pensions and Retirement, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Institute for Computer Applications in Science and Engineering., ed. On the freestream matching condition for stagnation point turbulent flows. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

O'Hagan, Anthony, and Mike West, eds. The Oxford Handbook of Applied Bayesian Analysis. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198703174.001.0001.

Full text

Abstract:

This handbook discusses various applications of modern Bayesian analysis in important and challenging problems. With contributions from leading researchers and practitioners in interdisciplinary Bayesian analysis, the book highlights current frontiers of research in each application. Each chapter involves a concise review of the application area, describes the problem contexts and goals, discusses aspects of the data and overall statistical issues, and offers detailed analysis with relevant Bayesian models and methods. The book is organised into five sections based on the field of application,

APA, Harvard, Vancouver, ISO, and other styles

7

Greenberg, Lyn R., Barbara J. Fidler, and Michael A. Saini, eds. Evidence-Informed Interventions for Court-Involved Families. Oxford University Press, 2019. http://dx.doi.org/10.1093/med-psych/9780190693237.001.0001.

Full text

Abstract:

Children at the center of high conflict divorce and/or child protection cases face increased risks to both current and future health and adjustment. There is a growing research base regarding these risks and the coping abilities skills that children need for successful adjustment, but training gaps and poorly structured services continue to be serious problems. The specific characteristics of these families, and risks faced by these children, underscore the importance of treatment, psychoeducation, and other services adapted to this population and directed to minimizing risks and promoting hea

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Planar matching"

1

Venkatesan, Shankar M. "Approximation algorithms for planar matching." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-16042-6_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Charmette, Baptiste, Eric Royer, and Frédéric Chausse. "Matching Planar Features for Robot Localization." In Advances in Visual Computing. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10331-5_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Voigt, Konrad, and Thomas Heinze. "Metamodel Matching Based on Planar Graph Edit Distance." In Theory and Practice of Model Transformations. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13688-7_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Li, Ang, Vlad I. Morariu, and Larry S. Davis. "Planar Structure Matching under Projective Uncertainty for Geolocation." In Computer Vision – ECCV 2014. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10584-0_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Cho, Minkyoung, and David M. Mount. "Improved Approximation Bounds for Planar Point Pattern Matching." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11534273_38.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bossut, F., and B. Warin. "Automata and pattern matching in planar directed acyclic graphs." In LATIN '92. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/bfb0023819.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kulkarni, Raghav, and Meena Mahajan. "Seeking a Vertex of the Planar Matching Polytope in NC." In Algorithms – ESA 2004. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30140-0_43.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Shao, Jie, and Nan Dong. "A Multi-view Fuzzy Matching Strategy with Multi-planar Homography." In Multimedia and Signal Processing. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-35286-7_24.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mishkin, Dmytro, and Jiří Matas. "Matching of Images of Non-planar Objects with View Synthesis." In SOFSEM 2014: Theory and Practice of Computer Science. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04298-5_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Yi, Meng, and Li-chun Sui. "Piecewise Planar Region Matching for High-Resolution Aerial Video Tracking." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48499-0_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Planar matching"

1

Hofhauser, Andreas, Carsten Steger, and Nassir Navab. "Perspective planar shape matching." In IS&T/SPIE Electronic Imaging, edited by Kurt S. Niel and David Fofi. SPIE, 2009. http://dx.doi.org/10.1117/12.807351.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Al-Khaiyat, M., and F. Kamangar. "Planar Curve Representation and Matching." In British Machine Vision Conference 1998. British Machine Vision Association, 1998. http://dx.doi.org/10.5244/c.12.18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Lv, Jixin, Yue Wang, Kanzhi Wu, Gamini Dissanayake, Yukinori Kobayashi, and Rong Xiong. "Planar scan matching using incident angle." In 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2017. http://dx.doi.org/10.1109/iros.2017.8206260.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

De Carufel, Jean-Lou, and Robert Laganiere. "Matching cylindrical panorama sequences using planar reprojections." In 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops). IEEE, 2011. http://dx.doi.org/10.1109/iccvw.2011.6130259.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Fisher, R. B. "Geometic Constraints from Planar Surface Patch Matching." In Alvey Vision Conference 1989. Alvey Vision Club, 1989. http://dx.doi.org/10.5244/c.3.10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Anari, Nima, and Vijay V. Vazirani. "Planar Graph Perfect Matching Is in NC." In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2018. http://dx.doi.org/10.1109/focs.2018.00068.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Wang, Tao, Haibin Ling, Congyan Lang, Songhe Feng, Yi Jin, and Yidong Li. "Constrained Confidence Matching for Planar Object Tracking." In 2018 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2018. http://dx.doi.org/10.1109/icra.2018.8460680.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Voevodin, Valerii G., and O. V. Leontieva. "Planar waveguide phase matching for backward parametric oscillation." In Material Science and Material Properties for Infrared Optoelectronics, edited by Fiodor F. Sizov. SPIE, 1999. http://dx.doi.org/10.1117/12.368396.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Rogers, R. L., D. P. Neikirk, and H. Ling. "Planar matching of antennas on electrically thick dielectric substrates." In 1987 Twelth International Conference on Infrared and Millimeter Waves. IEEE, 1987. http://dx.doi.org/10.1109/irmm.1987.9127032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lourakis, M. I. A., S. T. Halkidis, and S. C. Orphanoudakis. "Matching Disparate Views of Planar Surfaces using Projective Invariants." In British Machine Vision Conference 1998. British Machine Vision Association, 1998. http://dx.doi.org/10.5244/c.12.10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Planar matching"

1

Hopcroft, John E., and Daniel P. Huttenlocher. On Planar Point Matching under Affine Transformation. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada210106.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Beshears, John, James Choi, David Laibson, and Brigitte Madrian. The Impact of Employer Matching on Savings Plan Participation under Automatic Enrollment. National Bureau of Economic Research, 2007. http://dx.doi.org/10.3386/w13352.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Dahowski, Robert T., and James J. Dooley. Source/Sink Matching for U.S. Ethanol Plants and Candidate Deep Geologic Carbon Dioxide Storage Formations. Office of Scientific and Technical Information (OSTI), 2008. http://dx.doi.org/10.2172/938572.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Grant, C., J. Lenderman, and J. Gansemer. US-VISIT Identity Matching Algorithm Evaluation Program: ADIS Algorithm Evaluation Project Plan Update. Office of Scientific and Technical Information (OSTI), 2011. http://dx.doi.org/10.2172/1021071.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!