Relevant bibliographies by topics / Optimal matching

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Optimal matching'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 March 2023

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 'Optimal 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 "Optimal matching"

1

Mazón, José Manuel, Julio Daniel Rossi, and Julián Toledo. "On optimal matching measures for matching problems related to the Euclidean distance." Mathematica Bohemica 139, no. 4 (2014): 553–66. http://dx.doi.org/10.21136/mb.2014.144132.

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

CHENG, EDDIE, and SACHIN PADMANABHAN. "MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES." Parallel Processing Letters 22, no. 02 (May 16, 2012): 1250005. http://dx.doi.org/10.1142/s0129626412500053.

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 induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those induced by 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 thi
APA, Harvard, Vancouver, ISO, and other styles
3

Cabra, Luís M. B. "Optimal matching auctions." Economics Letters 37, no. 1 (September 1991): 7–9. http://dx.doi.org/10.1016/0165-1765(91)90234-c.

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

Baccara, Mariagiovanna, SangMok Lee, and Leeat Yariv. "Optimal dynamic matching." Theoretical Economics 15, no. 3 (2020): 1221–78. http://dx.doi.org/10.3982/te3740.

Full text
Abstract:
We study a dynamic matching environment where individuals arrive sequentially. There is a trade‐off between waiting for a thicker market, allowing for higher‐quality matches, and minimizing agents' waiting costs. The optimal mechanism cumulates a stock of incongruent pairs up to a threshold and matches all others in an assortative fashion instantaneously. In discretionary settings, a similar protocol ensues in equilibrium, but expected queues are inefficiently long. We quantify the welfare gain from centralization, which can be substantial, even for low waiting costs. We also evaluate welfare
APA, Harvard, Vancouver, ISO, and other styles
5

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 t
APA, Harvard, Vancouver, ISO, and other styles
6

Ekeland, Ivar. "An optimal matching problem." ESAIM: Control, Optimisation and Calculus of Variations 11, no. 1 (December 15, 2004): 57–71. http://dx.doi.org/10.1051/cocv:2004034.

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

Michalis, Constantine, Nicholas E. Scott-Samuel, David P. Gibson, and Innes C. Cuthill. "Optimal background matching camouflage." Proceedings of the Royal Society B: Biological Sciences 284, no. 1858 (July 12, 2017): 20170709. http://dx.doi.org/10.1098/rspb.2017.0709.

Full text
Abstract:
Background matching is the most familiar and widespread camouflage strategy: avoiding detection by having a similar colour and pattern to the background. Optimizing background matching is straightforward in a homogeneous environment, or when the habitat has very distinct sub-types and there is divergent selection leading to polymorphism. However, most backgrounds have continuous variation in colour and texture, so what is the best solution? Not all samples of the background are likely to be equally inconspicuous, and laboratory experiments on birds and humans support this view. Theory suggests
APA, Harvard, Vancouver, ISO, and other styles
8

Hollister, Matissa. "Is Optimal Matching Suboptimal?" Sociological Methods & Research 38, no. 2 (November 2009): 235–64. http://dx.doi.org/10.1177/0049124109346164.

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

Ramachandran, T., and K. Velusamy. "Optimal Matching Using SMA." Journal of Information and Optimization Sciences 35, no. 4 (July 4, 2014): 359–72. http://dx.doi.org/10.1080/02522667.2014.926705.

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

Didier, Gilles. "Optimal pattern matching algorithms." Journal of Complexity 51 (April 2019): 79–109. http://dx.doi.org/10.1016/j.jco.2018.10.003.

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

Dissertations / Theses on the topic "Optimal matching"

1

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
2

Moser, Hannes. "Finding optimal solutions for covering and matching problems." Göttingen Cuvillier, 2009. http://d-nb.info/999819399/04.

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

Kwanashie, Augustine. "Efficient algorithms for optimal matching problems under preferences." Thesis, University of Glasgow, 2015. http://theses.gla.ac.uk/6706/.

Full text
Abstract:
In this thesis we consider efficient algorithms for matching problems involving preferences, i.e., problems where agents may be required to list other agents that they find acceptable in order of preference. In particular we mainly study the Stable Marriage problem (SM), the Hospitals / Residents problem (HR) and the Student / Project Allocation problem (SPA), and some of their variants. In some of these problems the aim is to find a stable matching which is one that admits no blocking pair. A blocking pair with respect to a matching is a pair of agents that prefer to be matched to each other
APA, Harvard, Vancouver, ISO, and other styles
4

Singh, Rohit Ph D. Massachusetts Institute of Technology. "Automatically learning optimal formula simplifiers and database entity matching rules." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113938.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 153-161).<br>Traditionally, machine learning (ML) is used to find a function from data to optimize a numerical score. On the other hand, synthesis is traditionally used to find a function (or a program) that can be derived fr
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Hanyi. "Probabilistic matching systems : stability, fluid and diffusion approximations and optimal control." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/10570.

Full text
Abstract:
In this work we introduce a novel queueing model with two classes of users in which, instead of accessing a resource, users wait in the system to match with a candidate from the other class. The users are selective and the matchings occur probabilistically. This new model is useful for analysing the traffic in web portals that match people who provide a service with people who demand the same service, e.g. employment portals, matrimonial and dating sites and rental portals. We first provide a Markov chain model for these systems and derive the probability distribution of the number of matches
APA, Harvard, Vancouver, ISO, and other styles
6

Kumar, Deepak. "Optimal finite alphabet sources over partial response channels." Thesis, Texas A&M University, 2003. http://hdl.handle.net/1969.1/1044.

Full text
Abstract:
We present a serially concatenated coding scheme for partial response channels. The encoder consists of an outer irregular LDPC code and an inner matched spectrum trellis code. These codes are shown to offer considerable improvement over the i.i.d. capacity (> 1 dB) of the channel for low rates (approximately 0.1 bits per channel use). We also present a qualitative argument on the optimality of these codes for low rates. We also formulate a performance index for such codes to predict their performance for low rates. The results have been verified via simulations for the (1-D)/sqrt(2) and the (
APA, Harvard, Vancouver, ISO, and other styles
7

Burnham, Katherine Lee. "Information fusion for an unmanned underwater vehicle through probabilistic prediction and optimal matching." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/127297.

Full text
Abstract:
Thesis: S.M., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, May, 2020<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 89-92).<br>This thesis presents a method for information fusion for an unmanned underwater vehicle (UUV).We consider a system that fuses contact reports from automated information system (AIS) data and active and passive sonar sensors. A linear assignment problem with learned assignment costs is solved to fuse sonar and AIS data. Since the sensors operate effectively at different depths, the
APA, Harvard, Vancouver, ISO, and other styles
8

Akers, Allen. "Determination of the Optimal Number of Strata for Bias Reduction in Propensity Score Matching." Thesis, University of North Texas, 2010. https://digital.library.unt.edu/ark:/67531/metadc28380/.

Full text
Abstract:
Previous research implementing stratification on the propensity score has generally relied on using five strata, based on prior theoretical groundwork and minimal empirical evidence as to the suitability of quintiles to adequately reduce bias in all cases and across all sample sizes. This study investigates bias reduction across varying number of strata and sample sizes via a large-scale simulation to determine the adequacy of quintiles for bias reduction under all conditions. Sample sizes ranged from 100 to 50,000 and strata from 3 to 20. Both the percentage of bias reduction and the standard
APA, Harvard, Vancouver, ISO, and other styles
9

Salter, James Martin. "Uncertainty quantification for spatial field data using expensive computer models : refocussed Bayesian calibration with optimal projection." Thesis, University of Exeter, 2017. http://hdl.handle.net/10871/30114.

Full text
Abstract:
In this thesis, we present novel methodology for emulating and calibrating computer models with high-dimensional output. Computer models for complex physical systems, such as climate, are typically expensive and time-consuming to run. Due to this inability to run computer models efficiently, statistical models ('emulators') are used as fast approximations of the computer model, fitted based on a small number of runs of the expensive model, allowing more of the input parameter space to be explored. Common choices for emulators are regressions and Gaussian processes. The input parameters of the
APA, Harvard, Vancouver, ISO, and other styles
10

Araujo, Bruno César Pino Oliveira de. "Trajetórias ocupacionais de engenheiros jovens no Brasil." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/3/3136/tde-23062016-153336/.

Full text
Abstract:
Esta tese analisa 9.041 trajetórias ocupacionais de jovens engenheiros como empregados formais no Brasil entre 2003-2012, a partir da técnica de Optimal Matching Analysis (OMA). Estas trajetórias foram comparadas às de uma geração anterior de jovens engenheiros, tanto em seu período-base (1995-2002) como entre 2003-2012, a fim de identificar efeitos de idade e período. Os principais resultados são: (i) conforme esperado, trajetórias ocupacionais ligadas à gestão (em áreas correlatas à engenharia ou não) são as que oferecem remuneração mais alta em todos os períodos analisados; (ii) nos anos 20
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Optimal matching"

1

Aisenbrey, Silke. Optimal Matching Analyse. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6.

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

Thomas, Carlos. Search and matching functions and optimal monetary policy. London: Centre for Economic Performance, London School of Economics and Political Science, 2006.

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

Katzman, Brett. Optimal monetary impulse-response functions in a matching model. Cambridge, MA: National Bureau of Economic Research, 1999.

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

Katzman, Brett. Optimal monetary impulse-response functions in a matching model. [Minneapolis, Minn.]: Federal Reserve Bank of Minneapolis, 1999.

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

Halpin, Brendan. Class careers as sequences: An optimal matching analysis of work-life histories. Colchester: ESRC Research Centre on Micro-social Change, 1996.

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

Essays on Discrete Optimization: Optimal Stopping and Popular Matchings. [New York, N.Y.?]: [publisher not identified], 2022.

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

Dawson, K. M. Implicit model matching as an approach to three-dimensional object recognition. Dublin: Trinity College, Department of Computer Science, 1991.

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

Gloster, Lawrence Anthony William. Optical parametric oscillators: Noncollinear phase matching and linewidth studies in beta barium borate. Manchester: University of Manchester, 1995.

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

Li, Yanjun. Jing xiang pi pei yu mu biao shi bie ji shu. Xi an: Xi bei gong ye ta xue chu ban she, 2009.

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

I, Watson C., Paek Eung Gi, and National Institute of Standards and Technology (U.S.), eds. Effect of resolution and image quality on combined optical and neural network fingerprint matching. Gaithersburg, MD: U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, 1998.

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

Book chapters on the topic "Optimal matching"

1

Aisenbrey, Silke. "Vorbemerkung." In Optimal Matching Analyse, 11–12. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_1.

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

Aisenbrey, Silke. "Einleitung." In Optimal Matching Analyse, 13–18. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_2.

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

Aisenbrey, Silke. "Optimal Matching Analyse: Das Vorgehen." In Optimal Matching Analyse, 19–31. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_3.

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

Aisenbrey, Silke. "Forschungsstand: Die Optimal Matching Analyse in den Sozialwissenschaften." In Optimal Matching Analyse, 32–54. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_4.

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

Aisenbrey, Silke. "Optimal Matching Analyse: Ein Anwendungsbeispiel." In Optimal Matching Analyse, 55–109. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_5.

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

Aisenbrey, Silke. "Die Optimal Matching Analyse und andere Verfahren zur Analyse von zeitbezogenen Daten." In Optimal Matching Analyse, 110–18. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_6.

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

Aisenbrey, Silke. "Ist der Weg das Ziel? — Ein Ausblick." In Optimal Matching Analyse, 119–22. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_7.

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

Aisenbrey, Silke. "Anhang: Tabellen und Erläuterungen." In Optimal Matching Analyse, 123–27. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_8.

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

Aisenbrey, Silke. "Literaturverzeichnis." In Optimal Matching Analyse, 128–31. Wiesbaden: VS Verlag für Sozialwissenschaften, 2000. http://dx.doi.org/10.1007/978-3-663-10955-6_9.

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

Greevy, Robert A., and Bo Lu. "Optimal Nonbipartite Matching." In Handbook of Matching and Weighting Adjustments for Causal Inference, 227–38. Boca Raton: Chapman and Hall/CRC, 2023. http://dx.doi.org/10.1201/9781003102670-12.

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

Conference papers on the topic "Optimal matching"

1

Fleischer, R., and Yihui Wang. "Dynamic Pareto Optimal Matching." In 2008 International Symposium on Information Science and Engineering (ISISE). IEEE, 2008. http://dx.doi.org/10.1109/isise.2008.237.

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

Di Garbo, C., P. Livreri, and G. Vitale. "Optimal matching between optical rectennas and harvester circuits." In 2017 IEEE International Conference on Environment and Electrical Engineering and 2017 IEEE Industrial and Commercial Power Systems Europe (EEEIC / I&CPS Europe). IEEE, 2017. http://dx.doi.org/10.1109/eeeic.2017.7977686.

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

Long, Cheng, Raymond Chi-Wing Wong, Philip S. Yu, and Minhao Jiang. "On optimal worst-case matching." In the 2013 international conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2463676.2465321.

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

Costa, Mauro, Robert Haralick, Tsaiyun Phillips, and Linda Shapiro. "Optimal Affine-Invariant Point Matching." In SPIE 1989 Technical Symposium on Aerospace Sensing, edited by Mohan M. Trivedi. SPIE, 1989. http://dx.doi.org/10.1117/12.969300.

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

Paryanti, Gil, Dan Sadot, and Vladymir Lyandres. "Optimal Source Matching in Optical Code Division Multiple Access." In 2006 IEEE International Conference on Communications. IEEE, 2006. http://dx.doi.org/10.1109/icc.2006.255176.

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

Arenz, Oleg, Hany Abdulsamad, and Gerhard Neumann. "Optimal control and inverse optimal control by distribution matching." In 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2016. http://dx.doi.org/10.1109/iros.2016.7759596.

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

Dalvi, Nilesh, Vibhor Rastogi, Anirban Dasgupta, Anish Das Sarma, and Tamas Sarlos. "Optimal hashing schemes for entity matching." In the 22nd international conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2488388.2488415.

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

Bissell, Robert. "Calculating Optimal Parameters for History Matching." In ECMOR IV - 4th European Conference on the Mathematics of Oil Recovery. European Association of Geoscientists & Engineers, 1994. http://dx.doi.org/10.3997/2214-4609.201411181.

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

Costa, Mauro S., Robert M. Haralick, and Linda G. Shapiro. "Optimal affine-invariant matching: performance characterization." In SPIE/IS&T 1992 Symposium on Electronic Imaging: Science and Technology, edited by Albert A. Jamberdino and Carlton W. Niblack. SPIE, 1992. http://dx.doi.org/10.1117/12.58489.

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

Roumy, A., and D. Gesbert. "Optimal matching in wireless sensor networks." In 2007 IEEE International Symposium on Information Theory. IEEE, 2007. http://dx.doi.org/10.1109/isit.2007.4557533.

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

Reports on the topic "Optimal matching"

1

Mavris, Dimitri N., and Russell K. Denney. Optimal Robust Matching of Engine Models to Test Data. Fort Belvoir, VA: Defense Technical Information Center, February 2009. http://dx.doi.org/10.21236/ada498300.

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

Katzman, Brett, John Kennan, and Neil Wallace. Optimal Monetary Impulse-Response Functions in a Matching Model. Cambridge, MA: National Bureau of Economic Research, November 1999. http://dx.doi.org/10.3386/w7425.

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

Balduzzi, Pierluigi, and Jonathan Reuter. Heterogeneity in Target-Date Funds: Optimal Risk-Taking or Risk Matching? Cambridge, MA: National Bureau of Economic Research, March 2012. http://dx.doi.org/10.3386/w17886.

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

Lazarov, R. D., J. E. Pasciak, J. Schoberl, and P. S. Vassilevski. Almost Optimal Interior Penalty Discontinuous Approximations of Symmetric Elliptic Problems on Non-Matching Grids. Office of Scientific and Technical Information (OSTI), August 2001. http://dx.doi.org/10.2172/15006515.

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

Wilson, Charles L., Craig I. Watson, and Eung Gi Paek. Combined optical and neural network fingerprint matching. Gaithersburg, MD: National Institute of Standards and Technology, 1997. http://dx.doi.org/10.6028/nist.ir.5955.

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

Salamo, Gregory J. Advanced Nonlinear Optical Materials Using Quasi-Phase Matching. Fort Belvoir, VA: Defense Technical Information Center, May 1998. http://dx.doi.org/10.21236/ada358157.

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

Little, James J., and Alessandro Verri. Analysis of Differential and Matching Methods for Optical Flow. Fort Belvoir, VA: Defense Technical Information Center, August 1988. http://dx.doi.org/10.21236/ada234424.

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

Romero Molina, Paola Ximena. Teaching Lesson Planning to EFL Preservice Teachers: A Review of Studies. Institucion Universitaria Colombo Americana, 2022. http://dx.doi.org/10.26817/paper.19.

Full text
Abstract:
Preparing English as a Foreign Language (EFL) preservice teachers for lesson planning has a been a concern among teacher educators globally. Research has shown that preservice teachers encounter difficulties in aspects such as objective setting, considering their learners’ needs, and matching assessment and objectives, among others. Similarly, preservice teachers still need to be presented with ample opportunities for reflective teaching. These concerns have been addressed by teacher educators in systematic ways. Hence, guided by two sets of research questions, this literature review aims at e
APA, Harvard, Vancouver, ISO, and other styles
9

Wilson, C. L., C. I. Watson, and E. G. Paek. Effect of resolution and image quality on combined optical and neural network fingerprint matching. Gaithersburg, MD: National Institute of Standards and Technology, 1998. http://dx.doi.org/10.6028/nist.ir.6184.

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

Gabow, Harold N., and Robert E. Tarjan. Almost-Optimum Parallel Speed-Ups of Algorithms for Bipartite Matching and Related Problems. Fort Belvoir, VA: Defense Technical Information Center, January 1989. http://dx.doi.org/10.21236/ada215111.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Optimal 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