Gotowe bibliografie tematyczne / Matching

Gotowa bibliografia na temat „Matching”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 8 czerwca 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Matching”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Matching"

1

CHENG, EDDIE, i SACHIN PADMANABHAN. "MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES". Parallel Processing Letters 22, nr 02 (16.05.2012): 1250005. http://dx.doi.org/10.1142/s0129626412500053.

Pełny tekst źródła
Streszczenie:
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 this paper, we find the matching preclusion number and the conditional matching preclusion number with the classification of the optimal sets for the class of crossed cubes, an important variant of the class of hypercubes. Indeed, we will establish more general results on the matching preclusion and the conditional matching preclusion problems for a larger class of interconnection networks.
Style APA, Harvard, Vancouver, ISO itp.
2

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

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

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
4

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

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
5

Echenique, Federico, SangMok Lee, Matthew Shum i M. Bumin Yenmez. "Stability and Median Rationalizability for Aggregate Matchings". Games 12, nr 2 (9.04.2021): 33. http://dx.doi.org/10.3390/g12020033.

Pełny tekst źródła
Streszczenie:
We develop the theory of stability for aggregate matchings used in empirical studies and establish fundamental properties of stable matchings including the result that the set of stable matchings is a non-empty, complete, and distributive lattice. Aggregate matchings are relevant as matching data in revealed preference theory. We present a result on rationalizing a matching data as the median stable matching.
Style APA, Harvard, Vancouver, ISO itp.
6

Cannas, Massimo, i Emiliano Sironi. "Optimal Matching with Matching Priority". Analytics 3, nr 1 (19.03.2024): 165–77. http://dx.doi.org/10.3390/analytics3010009.

Pełny tekst źródła
Streszczenie:
Matching algorithms are commonly used to build comparable subsets (matchings) in observational studies. When a complete matching is not possible, some units must necessarily be excluded from the final matching. This may bias the final estimates comparing the two populations, and thus it is important to reduce the number of drops to avoid unsatisfactory results. Greedy matching algorithms may not reach the maximum matching size, thus dropping more units than necessary. Optimal matching algorithms do ensure a maximum matching size, but they implicitly assume that all units have the same matching priority. In this paper, we propose a matching strategy which is order optimal in the sense that it finds a maximum matching size which is consistent with a given matching priority. The strategy is based on an order-optimal matching algorithm originally proposed in connection with assignment problems by D. Gale. When a matching priority is given, the algorithm ensures that the discarded units have the lowest possible matching priority. We discuss the algorithm’s complexity and its relation with classic optimal matching. We illustrate its use with a problem in a case study concerning a comparison of female and male executives and a simulation.
Style APA, Harvard, Vancouver, ISO itp.
7

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

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
8

Wang, Xia, Tianlong Ma, Jun Yin i Chengfu Ye. "Fractional matching preclusion for radix triangular mesh". Discrete Mathematics, Algorithms and Applications 11, nr 04 (sierpień 2019): 1950048. http://dx.doi.org/10.1142/s1793830919500484.

Pełny tekst źródła
Streszczenie:
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. As a generalization, Liu and Liu recently introduced the concept of fractional matching preclusion number. The fractional matching preclusion number (FMP number) of [Formula: see text], denoted by [Formula: see text], is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The fractional strong matching preclusion number (FSMP number) of [Formula: see text], denoted by [Formula: see text], is the minimum number of vertices and edges whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we study the fractional matching preclusion number and the fractional strong matching preclusion number for the radix triangular mesh [Formula: see text], and all the optimal fractional matching preclusion sets and fractional strong matching preclusion sets of these graphs are categorized.
Style APA, Harvard, Vancouver, ISO itp.
9

Anantapantula, Sai, Christopher Melekian i Eddie Cheng. "Matching Preclusion for the Shuffle-Cubes". Parallel Processing Letters 28, nr 03 (wrzesień 2018): 1850012. http://dx.doi.org/10.1142/s0129626418500123.

Pełny tekst źródła
Streszczenie:
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. A graph is maximally matched if its matching preclusion number is equal to its minimum degree, and is super matched if the matching preclusion number can only be achieved by deleting all edges incident to a single vertex. In this paper, we determine the matching preclusion number and classify the optimal matching preclusion sets for the shuffle-cube graphs, a variant of the well-known hypercubes.
Style APA, Harvard, Vancouver, ISO itp.
10

Greinecker, Michael, i Christopher Kah. "Pairwise Stable Matching in Large Economies". Econometrica 89, nr 6 (2021): 2929–74. http://dx.doi.org/10.3982/ecta16228.

Pełny tekst źródła
Streszczenie:
We formulate a stability notion for two‐sided pairwise matching problems with individually insignificant agents in distributional form. Matchings are formulated as joint distributions over the characteristics of the populations to be matched. Spaces of characteristics can be high‐dimensional and need not be compact. Stable matchings exist with and without transfers, and stable matchings correspond precisely to limits of stable matchings for finite‐agent models. We can embed existing continuum matching models and stability notions with transferable utility as special cases of our model and stability notion. In contrast to finite‐agent matching models, stable matchings exist under a general class of externalities.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Matching"

1

Ranger, Martin. "Matching issues". College Park, Md. : University of Maryland, 2005. http://hdl.handle.net/1903/2690.

Pełny tekst źródła
Streszczenie:
Thesis (Ph. D.) -- University of Maryland, College Park, 2005.
Thesis research directed by: Economics. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Style APA, Harvard, Vancouver, ISO itp.
2

Prakash, Piyush Martin Alain J. "Slack matching /". Diss., Pasadena, Calif. : California Institute of Technology, 2005. http://resolver.caltech.edu/CaltechETD:etd-05272005-134017.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Tam, Siu-lung, i 譚小龍. "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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Ko, E. Soon. "Product Matching through Multimodal Image and Text Combined Similarity Matching". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-301306.

Pełny tekst źródła
Streszczenie:
Product matching in e-commerce is an area that faces more and more challenges with growth in the e-commerce marketplace as well as variation in the quality of data available online for each product. Product matching for e-commerce provides competitive possibilities for vendors and flexibility for customers by identifying identical products from different sources. Traditional methods in product matching are often conducted through rule-based methods and methods tackling the issue through machine learning usually do so through unimodal systems. Moreover, existing methods would tackle the issue through product identifiers which are not always unified for each product. This thesis provides multimodal approaches through product name, description, and image to the problem area of product matching that outperforms unimodal approaches. Three multimodal approaches were taken, one unsupervised and two supervised. The unsupervised approach uses straight-forward embedding space to nearest neighbor search that provides better results than unimodal approaches. One of the supervised multimodal approaches uses Siamese network on the embedding space which outperforms the unsupervised multi- modal approach. Finally, the last supervised approach instead tackles the issue by exploiting distance differences in each modality through logistic regression and a decision system that provided the best results.
Produktmatchning inom e-handel är ett område som möter fler och fler utmaningar med hänsyn till den tillväxt som e-handelsmarknaden undergått och fortfarande undergår samt variation i kvaliteten på den data som finns tillgänglig online för varje produkt. Produktmatchning inom e-handel är ett område som ger konkurrenskraftiga möjligheter för leverantörer och flexibilitet för kunder genom att identifiera identiska produkter från olika källor. Traditionella metoder för produktmatchning genomfördes oftast genom regelbaserade metoder och metoder som utnyttjar maskininlärning gör det vanligtvis genom unimodala system. Dessutom utnyttjar mestadels av befintliga metoder produktidentifierare som inte alltid är enhetliga för varje produkt mellan olika källor. Denna studie ger istället förslag till multimodala tillvägagångssätt som istället använder sig av produktnamn, produktbeskrivning och produktbild för produktmatchnings-problem vilket ger bättre resultat än unimodala metoder. Tre multimodala tillvägagångssätt togs, en unsupervised och två supervised. Den unsupervised metoden använder embeddings vektorerna rakt av för att göra en nearest neighborsökning vilket gav bättre resultat än unimodala tillvägagångssätt. Ena supervised multimodal tillvägagångssätten använder siamesiska nätverk på embedding utrymmet vilket gav resultat som överträffade den unsupervised multimodala tillvägagångssättet. Slutligen tar den sista supervised metoden istället avståndsskillnader i varje modalitet genom logistisk regression och ett beslutssystem som gav bästa resultaten.
Style APA, Harvard, Vancouver, ISO itp.
7

Karichery, Sureshan. "Sequential matching problem". [S.l. : s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=971627754.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Michalis, Konstantinos. "Background matching camouflage". Thesis, University of Bristol, 2017. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.723478.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Neou, Both Emerite. "Permutation pattern matching". Thesis, Paris Est, 2017. http://www.theses.fr/2017PESC1239/document.

Pełny tekst źródła
Streszczenie:
Cette thèse s'intéresse au problème de la recherche de motif dans les permutations, qui a pour objectif de savoir si un motif apparaît dans un texte, en prenant en compte que le motif et le texte sont des permutations. C'est-à-dire s'il existe des éléments du texte tel que ces éléments sont triés de la même manière et apparaissent dans le même ordre que les éléments du motif. Ce problème est NP complet. Cette thèse expose des cas particuliers de ce problème qui sont solvable en temps polynomial.Pour cela nous étudions le problème en donnant des contraintes sur le texte et/ou le motif. En particulier, le cas où le texte et/ou le motif sont des permutations qui ne contiennent pas les motifs 2413 et 3142 (appelé permutation séparable) et le cas où le texte et/ou le motif sont des permutations qui ne contiennent pas les motifs 213 et 231 sont considérés. Des problèmes dérivés de la recherche de motif et le problème de la recherche de motif bivinculaire sont aussi étudiés
This thesis focuses on permutation pattern matching problem, which askswhether a pattern occurs in a text where both the pattern and text are permutations.In other words, we seek to determine whether there exist elements ofthe text such that they are sorted and appear in the same order as the elementsof the pattern. The problem is NP-complete. This thesis examines particularcases of the problem that are polynomial-time solvable.For this purpose, we study the problem by giving constraints on the permutationstext and/or pattern. In particular, the cases in which the text and/orpattern are permutations in which the patterns 2413 and 3142 do not occur(also known as separable permutations) and in which the text and/or patternare permutations in which the patterns 213 and 231 do not occur (also known aswedge permutations) are also considered. Some problems related to the patternmatching and the permutation pattern matching with bivincular pattern arealso studied
Style APA, Harvard, Vancouver, ISO itp.
10

Modi, Amit. "Matching Based Diversity". The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1306866934.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Matching"

1

Istar, Schwager, Siede George i Preis Donna, red. Matching. London: Evans Bros., 1994.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Siede, George. Matching. Lincolnwood, Ill: Publications International, 1993.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

(Firm), Clever Factory, i Cuddly Duck Productions, red. Turn & learn matching. Nashville, TN: Clever Factory, 2007.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Lovász, László. Matching theory. Amsterdam: North-Holland, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Lovász, László. Matching theory. Budapest: Akadémiai Kiadó, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Lovász, L. Matching theory. Amsterdam: North-Holland, 1986.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

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

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Mortensen, Dale. Island matching. Cambridge, MA: National Bureau of Economic Research, 2007.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

D'Orazio, Marcello, Marco Di Zio i Mauro Scanu. Statistical Matching. Chichester, UK: John Wiley & Sons, Ltd, 2006. http://dx.doi.org/10.1002/0470023554.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Rässler, Susanne. Statistical Matching. New York, NY: Springer New York, 2002. http://dx.doi.org/10.1007/978-1-4613-0053-3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Matching"

1

Euzenat, Jérôme, i Pavel Shvaiko. "Matching Strategies". W Ontology Matching, 149–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38721-0_7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Kleinbaum, David G., Kevin M. Sullivan i Nancy D. Barker. "Matching". W ActivEpi Companion Textbook, 477–515. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-5428-1_15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Gerth, Christian. "Matching". W Business Process Models. Change Management, 51–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38604-6_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Kozen, Dexter C. "Matching". W The Design and Analysis of Algorithms, 101–5. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4612-4400-4_19.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

French, Michael J. "Matching". W Conceptual Design for Engineers, 117–42. London: Springer London, 1999. http://dx.doi.org/10.1007/978-1-4471-3627-9_5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Eglese, Richard W. "Matching". W Encyclopedia of Operations Research and Management Science, 490–92. New York, NY: Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_589.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Allen, Peter K. "Matching". W 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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Davison, Michael. "Matching". W Encyclopedia of the Sciences of Learning, 2100–2104. Boston, MA: Springer US, 2012. http://dx.doi.org/10.1007/978-1-4419-1428-6_484.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Hochstättler, Winfried, i Alexander Schliep. "Matching". W CATBox, 111–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03822-8_8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Nemhauser, George, i Laurence Wolsey. "Matching". W Integer and Combinatorial Optimization, 608–58. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2014. http://dx.doi.org/10.1002/9781118627372.ch15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Matching"

1

Bacso, Gabor, Anita Keszler i Zsolt Tuza. "Matching Matchings". W 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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Jandaghi, Pegah, i Jay Pujara. "Identifying Quantifiably Verifiable Statements from Text". W Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Stroudsburg, PA, USA: Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Baek, Jinheon, Alham Aji i Amir Saffari. "Knowledge-Augmented Language Model Prompting for Zero-Shot Knowledge Graph Question Answering". W Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Stroudsburg, PA, USA: Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.7.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Schumacher, Elliot, James Mayfield i Mark Dredze. "On the Surprising Effectiveness of Name Matching Alone in Autoregressive Entity Linking". W Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Stroudsburg, PA, USA: Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Ramanan, Karthik. "Corpus-Based Task-Specific Relation Discovery". W Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Stroudsburg, PA, USA: Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Yuan, Jiaqing, Michele Merler, Mihir Choudhury, Raju Pavuluri, Munindar Singh i Maja Vukovic. "CoSiNES: Contrastive Siamese Network for Entity Standardization". W Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Stroudsburg, PA, USA: Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Wold, Sondre, Lilja Øvrelid i Erik Velldal. "Text-To-KG Alignment: Comparing Current Methods on Classification Tasks". W Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Stroudsburg, PA, USA: Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Chen, Lihu, Simon Razniewski i Gerhard Weikum. "Knowledge Base Completion for Long-Tail Entities". W Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Stroudsburg, PA, USA: Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.8.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Zhang, Meiru, Yixuan Su, Zaiqiao Meng, Zihao Fu i Nigel Collier. "COFFEE: A Contrastive Oracle-Free Framework for Event Extraction". W Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Stroudsburg, PA, USA: Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Jin, Xiaomeng, Haoyang Wen, Xinya Du i Heng Ji. "Toward Consistent and Informative Event-Event Temporal Relation Extraction". W Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023). Stroudsburg, PA, USA: Association for Computational Linguistics, 2023. http://dx.doi.org/10.18653/v1/2023.matching-1.3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Matching"

1

Mortensen, Dale. Island Matching. Cambridge, MA: National Bureau of Economic Research, sierpień 2007. http://dx.doi.org/10.3386/w13287.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Margolius, Barbara. Derivative Matching Game. Washington, DC: The MAA Mathematical Sciences Digital Library, lipiec 2008. http://dx.doi.org/10.4169/loci002651.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Dauth, Wolfgang, Sebastian Findeisen, Enrico Moretti i Jens Suedekum. Matching in Cities. Cambridge, MA: National Bureau of Economic Research, listopad 2018. http://dx.doi.org/10.3386/w25227.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Schwarz, Michael, i M. Bumin Yenmez. Median Stable Matching. Cambridge, MA: National Bureau of Economic Research, styczeń 2009. http://dx.doi.org/10.3386/w14689.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Lange, Fabian, i Theodore Papageorgiou. Beyond Cobb-Douglas: Flexibly Estimating Matching Functions with Unobserved Matching Efficiency. Cambridge, MA: National Bureau of Economic Research, kwiecień 2020. http://dx.doi.org/10.3386/w26972.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Duffie, Darrell, Lei Qiao i Yeneng Sun. Dynamic Directed Random Matching. Cambridge, MA: National Bureau of Economic Research, listopad 2015. http://dx.doi.org/10.3386/w21731.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Diamond, Peter, i Ayşegül Şahin. Disaggregating the Matching Function. Cambridge, MA: National Bureau of Economic Research, grudzień 2016. http://dx.doi.org/10.3386/w22965.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Marriner, John, i /Fermilab. Phase Space Matching Errors. Office of Scientific and Technical Information (OSTI), marzec 1994. http://dx.doi.org/10.2172/984595.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Phillips, A., i M. Davis. Matching of Language Tags. RFC Editor, wrzesień 2006. http://dx.doi.org/10.17487/rfc4647.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Tsoukalas, L. DOE Matching Grant Program. Office of Scientific and Technical Information (OSTI), grudzień 2002. http://dx.doi.org/10.2172/836053.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Matching” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii