Bibliografías temáticas / Matching

Índice

  1. Artículos de revistas
  2. Tesis
  3. Libros
  4. Capítulos de libros
  5. Actas de conferencias
  6. Informes

Literatura académica sobre el tema "Matching"

Autor: Grafiati
Publicado: 4 de junio de 2021
Última modificación: 1 de agosto de 2024

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Matching".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "Matching"

1

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

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

MAO, YAPING y EDDIE CHENG. "A Concise Survey of Matching Preclusion in Interconnection Networks". Journal of Interconnection Networks 19, n.º 03 (septiembre de 2019): 1940006. http://dx.doi.org/10.1142/s0219265919400061.

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

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

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Echenique, Federico, SangMok Lee, Matthew Shum y M. Bumin Yenmez. "Stability and Median Rationalizability for Aggregate Matchings". Games 12, n.º 2 (9 de abril de 2021): 33. http://dx.doi.org/10.3390/g12020033.

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Cannas, Massimo y Emiliano Sironi. "Optimal Matching with Matching Priority". Analytics 3, n.º 1 (19 de marzo de 2024): 165–77. http://dx.doi.org/10.3390/analytics3010009.

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

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

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

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

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Anantapantula, Sai, Christopher Melekian y Eddie Cheng. "Matching Preclusion for the Shuffle-Cubes". Parallel Processing Letters 28, n.º 03 (septiembre de 2018): 1850012. http://dx.doi.org/10.1142/s0129626418500123.

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

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

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Tesis sobre el tema "Matching"

1

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

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
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.

Texto completo
Resumen
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.
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

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

Texto completo
Resumen
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
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Libros sobre el tema "Matching"

1

Istar, Schwager, Siede George y Preis Donna, eds. Matching. London: Evans Bros., 1994.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

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

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

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

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

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

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

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

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

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

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

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

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Vosselman, G., ed. Relational Matching. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55798-9.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Más fuentes

Capítulos de libros sobre el tema "Matching"

1

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Gerth, Christian. "Matching". En 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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Kozen, Dexter C. "Matching". En 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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Eglese, Richard W. "Matching". En 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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Davison, Michael. "Matching". En 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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.

Actas de conferencias sobre el tema "Matching"

1

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Jandaghi, Pegah y Jay Pujara. "Identifying Quantifiably Verifiable Statements from Text". En 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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Baek, Jinheon, Alham Aji y Amir Saffari. "Knowledge-Augmented Language Model Prompting for Zero-Shot Knowledge Graph Question Answering". En 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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Schumacher, Elliot, James Mayfield y Mark Dredze. "On the Surprising Effectiveness of Name Matching Alone in Autoregressive Entity Linking". En 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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Ramanan, Karthik. "Corpus-Based Task-Specific Relation Discovery". En 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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Yuan, Jiaqing, Michele Merler, Mihir Choudhury, Raju Pavuluri, Munindar Singh y Maja Vukovic. "CoSiNES: Contrastive Siamese Network for Entity Standardization". En 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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Wold, Sondre, Lilja Øvrelid y Erik Velldal. "Text-To-KG Alignment: Comparing Current Methods on Classification Tasks". En 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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Chen, Lihu, Simon Razniewski y Gerhard Weikum. "Knowledge Base Completion for Long-Tail Entities". En 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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Zhang, Meiru, Yixuan Su, Zaiqiao Meng, Zihao Fu y Nigel Collier. "COFFEE: A Contrastive Oracle-Free Framework for Event Extraction". En 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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Jin, Xiaomeng, Haoyang Wen, Xinya Du y Heng Ji. "Toward Consistent and Informative Event-Event Temporal Relation Extraction". En 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.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.

Informes sobre el tema "Matching"

1

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Phillips, A. y M. Davis. Matching of Language Tags. RFC Editor, septiembre de 2006. http://dx.doi.org/10.17487/rfc4647.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
También puede estar interesado en las bibliografías ampliadas sobre el tema "Matching" para tipos de fuentes particulares:
Artículos de revistas Tesis Libros
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!

Pasar a la bibliografía