Zobrazeno 1 - 10
of 72
pro vyhledávání: '"György Turán"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 14 no. 2, Iss Combinatorics (2012)
Combinatorics
Externí odkaz:
https://doaj.org/article/c642465acb744ba1a58e0546561e9e6b
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 89:1-5
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab815a7708536c6c1ded654abec3f83c
https://doi.org/10.1007/s10472-020-09711-5
https://doi.org/10.1007/s10472-020-09711-5
Publikováno v:
AAAI
Word embeddings have developed into a major NLP tool with broad applicability. Understanding the semantic content of word embeddings remains an important challenge for additional applications. One aspect of this issue is to explore the interpretabili
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b06e089aa234f41f10a00d33ef5172a0
https://doi.org/10.1609/aaai.v34i05.6235
https://doi.org/10.1609/aaai.v34i05.6235
Publikováno v:
Scopus-Elsevier
A nearest neighbor representation of a Boolean function is a set of positive and negative prototypes in $R^n$ such that the function has value 1 on an input iff the closest prototype is positive. For $k$-nearest neighbor representation the majority c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c7193fd825ebc58532329fbbd6b006e
http://arxiv.org/abs/2004.01741
http://arxiv.org/abs/2004.01741
Publikováno v:
Theoretical Computer Science. 658:417-428
We introduce a new graph parameter, the hydra number , arising from the minimization problem for Horn formulas in propositional logic. The hydra number of a graph G = ( V , E ) is the minimal number of hyperarcs of the form u , v → w required in a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d35a5630d70630f45695f953d8bd0d8f
https://doi.org/10.1016/j.tcs.2016.05.036
https://doi.org/10.1016/j.tcs.2016.05.036
Publikováno v:
Journal of Experimental & Theoretical Artificial Intelligence. 29:679-693
We administered the Verbal IQ (VIQ) part of the Wechsler Preschool and Primary Scale of Intelligence (WPPSI-III) to the ConceptNet 4 artificial intelligence (AI) system. The test questions (e.g. “Why do we shake hands?”) were translated into Conc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8005d06e247f955e07339a32e2840d7
https://doi.org/10.1080/0952813x.2016.1213060
https://doi.org/10.1080/0952813x.2016.1213060
Betweenness centrality of a vertex in a graph measures the fraction of shortest paths going through the vertex. This is a basic notion for determining the importance of a vertex in a network. The $k$-betweenness centrality of a vertex is defined simi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d513e683e3a8909a4dcd7d26b55f6c9b
http://arxiv.org/abs/1607.02334
http://arxiv.org/abs/1607.02334
Autor:
György Turán, Jon Yaggie
Publikováno v:
Logics in Artificial Intelligence ISBN: 9783319487571
JELIA
JELIA
Delgrande and Peppas characterized Horn belief revision operators obtained from Horn compliant faithful rankings by minimization, showing that a Horn belief revision operator belongs to this class if and only if it satisfies the Horn AGM postulates a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb31557fa25cbd3b4b6c55c6b9934a05
https://doi.org/10.1007/978-3-319-48758-8_32
https://doi.org/10.1007/978-3-319-48758-8_32
Autor:
Dhruv Mubayi, György Turán
Publikováno v:
Information Processing Letters. 110:174-177
Polynomial algorithms are given for the following two problems: • given a graph with n vertices and m edges, find a complete balanced bipartite subgraph K q , q with q = ⌊ ln n ln ( 2 e n 2 / m ) ⌋ , • given a graph with n vertices, find a de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::102641a64182641da73277aa7711ef97
https://doi.org/10.1016/j.ipl.2009.11.015
https://doi.org/10.1016/j.ipl.2009.11.015
Publikováno v:
Journal on Satisfiability, Boolean Modeling and Computation. 7:1-15
Selman and Kautz proposed an approach to compute a Horn CNF approximation of CNF formulas. We extend this approach and propose a new algorithm for the Horn least upper bound that involves renaming variables. Although we provide negative results for t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1355088bd28eae5dedd69655e8dc613e
https://doi.org/10.3233/sat190072
https://doi.org/10.3233/sat190072