Zobrazeno 1 - 10
of 86
pro vyhledávání: '"Leonard Pitt"'
Autor:
Leonard Pitts, Roland Heck, Matteo Montagner, Adam Penkalla, Markus Kofler, Volkmar Falk, Jörg Kempfert, Semih Buz
Publikováno v:
Frontiers in Cardiovascular Medicine, Vol 10 (2023)
IntroductionOpen surgical repair remains the current gold standard for the treatment of acute type A aortic dissection. However, especially elderly patients with relevant comorbidities who are deemed unfit for open surgery may benefit from a minimall
Externí odkaz:
https://doaj.org/article/d4c4873e21d642b48e58699caaa47a1d
Autor:
Leonard Pitt
This is Leonard Pitt's story of growing up the misfit in Detroit in the 1940s and 50s. In a later age he would have been put on Ritalin and paraded before psychiatrists because he couldn't pay attention in school. In 1962, at the end of a misguided f
Publikováno v:
Artificial Intelligence. 156:115-138
A version space is a collection of concepts consistent with a given set of positive and negative examples. Mitchell [Artificial Intelligence 18 (1982) 203–226] proposed representing a version space by its boundary sets: the maximally general (G) an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d67883e486162482b34d51c30944fa5
https://doi.org/10.1016/j.artint.2003.04.003
https://doi.org/10.1016/j.artint.2003.04.003
Autor:
Leonard Pitt
Publikováno v:
Southern California Quarterly. 86:65-82
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28f8bdcf9a4c89537f962fdab6d35d63
https://doi.org/10.2307/41172199
https://doi.org/10.2307/41172199
Publikováno v:
Machine Learning. 37:89-110
We consider exact learning monotone CNF formulas in which each variable appears at most some constant k times (“read-k” monotone CNF). Let f : l0,1r^n → l0,1r be expressible as a read-k monotone CNF formula for some natural number k. We give an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9b31ae1c83da11aa6185bc97cbdf25d
https://doi.org/10.1023/a:1007627028578
https://doi.org/10.1023/a:1007627028578
Publikováno v:
SIAM Journal on Computing. 27:1515-1530
We study the learnability of read-k-satisfy-j (RkSj) DNF formulas. These are boolean formulas in disjunctive normal form (DNF), in which the maximum number of occurrences of a variable is bounded by k, and the number of terms satisfied by any assignm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b34807ae8ae47efdcdbc013b9caee090
https://doi.org/10.1137/s0097539794274398
https://doi.org/10.1137/s0097539794274398
Autor:
Leonard Pitt, Stephen Kwek
Publikováno v:
Algorithmica. 22:53-75
A randomized learning algorithm {POLLY} is presented that efficiently learns intersections of s halfspaces in n dimensions, in time polynomial in both s and n . The learning protocol is the PAC (probably approximately correct) model of Valiant, augme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd4e6a4b1cb70c35e39b2012832e4c32
https://doi.org/10.1007/pl00013834
https://doi.org/10.1007/pl00013834
Publikováno v:
computational complexity. 7:19-53
We investigate the complexity of learning for the well-studied model in which the learning algorithm may ask membership and equivalence queries. While complexity theoretic techniques have previously been used to prove hardness results in various lear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7f7461344d47c50150a3d8f5cb47143
https://doi.org/10.1007/pl00001593
https://doi.org/10.1007/pl00001593
Autor:
Leonard Pitt, Michael D. Frazier
Publikováno v:
Machine Learning. 25:151-193
Description logics, also called terminological logics, are commonly used in knowledge-based systems to describe objects and their relationships. We investigate the learnability of a typical description logic, Classic, and show that Classic sentences
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24ef22b457c3c81e8ae9b92aeaa1a9c3
https://doi.org/10.1007/bf00114009
https://doi.org/10.1007/bf00114009
Autor:
Howard Aizenstein, Leonard Pitt
Publikováno v:
Machine Learning. 19:183-208
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5723a8d657005bf4124c4fc8abadb4a
https://doi.org/10.1007/bf00996269
https://doi.org/10.1007/bf00996269