نتایج جستجو برای: kearns
تعداد نتایج: 790 فیلتر نتایج به سال:
The immediate – indeed striking – observation on reading the valuable conference paper by Kearns and Lowe is just how remarkable a decade Australia had in the 2000s compared with our rich world peers. If this were a paper reviewing the experience of the past decade in almost any other western nation, it could be rapidly summarised as 'bad stuff happens'. Yet the point driven home by Kearns and ...
m.3291T > C mutation in the MT-TL1 gene has been infrequently encountered in association with mitochondrial myopathy, encephalopathy, lactic acidosis and stroke-like episodes (MELAS), however remains poorly characterized from a clinical perspective. In the following report we describe in detail the phenotypic features, long term follow up (> 7 years) and management in a Caucasian family with ME...
We present a provably efficient and near-optimal algorithm for reinforcement learning in Markov decision processes (MDPs) whose transition model can be factored as a dynamic Bayesian network (DBN). Our algorithm generalizes the recent E3 algorithm of Kearns and Singh, and assumes that we are given both an algorithm for approximate planning, and the graphical structure (but not the parameters) o...
Published Ahead of Print 6 August 2012. 10.1128/AAC.01199-12. 2012, 56(10):4997. DOI: Antimicrob. Agents Chemother. Girbe Buist and Sollid, Joseph F. John Jr., Robert Daum, Bo Soderquist Kreiswirth, Kwan Soo Ko, Hajo Grundmann, Johanna E. Boyle-Vavra, Frederic Laurent, Angela M. Kearns, Barry O'Brien, Fred C. Tenover, Duarte C. Oliveira, Susan Robert L. Skov, Kunyan Zhang, Henrik Westh, Frances...
Chronic progressive external ophthalmoplegia and cerebellar atrophy: A case of kearns-sayre syndrome
We explore the relationship between a natural notion of unsupervised learning studied by Kearns et al. (STOC ’94), which we call here “learning to create” (LTC), and the standard PAC model of Valiant (CACM ’84), which is a form of supervised learning and can be thought of as a formalization of “learning to appreciate”. Our main theorem states that “if learning to appreciate is hard, then so is ...
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves such as phase transitions. Here we use a variant of their ideas to derive an upper bound on the generalization error of a hypothesis computable from its training error and the histogram of training errors for the hypothes...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید