32 papers:
HCI-UC-2015-ClarkeBK #experience #question #using #what- What Learnability Issues Do Primary Care Physicians Experience When Using CPOE? (MAC, JLB, MSK), pp. 373–383.
HIMI-IKD-2015-BarberB- Effects of Tacton Names and Learnability (DB, CB), pp. 335–344.
LATA-2014-Kalocinski #on the- On Computability and Learnability of the Pumping Lemma Function (DK), pp. 433–440.
ICML-c2-2014-LiuD #learning #problem #set- Learnability of the Superset Label Learning Problem (LPL, TGD), pp. 1629–1637.
IFL-2013-LammelSV #haskell- The 101haskell Chrestomathy: A Whole Bunch of Learnable λs (RL, TS, AV), p. 25.
LATA-2012-GaoS- Learnability of Co-r.e. Classes (ZG, FS), pp. 252–263.
LATA-2011-Marciniec- Tarski’s Principle, Categorial Grammars and Learnability (JM), pp. 378–389.
DUXU-v2-2011-Hofman #modelling #statistics- Range Statistics and the Exact Modeling of Discrete Non-Gaussian Distributions on Learnability Data (RH), pp. 421–430.
LATA-2010-Clark #modelling- Three Learnable Models for the Description of Language (AC), pp. 16–31.
LATA-2010-JainLS #automation- Learnability of Automatic Classes (SJ, QL, FS), pp. 321–332.
CHI-2009-GarzonisJJO #mobile- Auditory icon and earcon mobile service notifications: intuitiveness, learnability, memorability and preference (SG, SLJ, TJ, EO), pp. 1513–1522.
CHI-2009-GrossmanFA #bibliography #guidelines #metric- A survey of software learnability: metrics, methodologies and guidelines (TG, GWF, RA), pp. 649–658.
HCI-NT-2009-Wang09a #concept #design- Learn as Babies Learn: A Conceptual Model of Designing Optimum Learnability (DXW), pp. 745–751.
FSE-2008-StylosM #api- The implications of method placement on API learnability (JS, BAM), pp. 105–112.
LICS-2007-IdziakMMVW #algebra- Tractability and learnability arising from algebras with few subpowers (PMI, PM, RM, MV, RW), pp. 213–224.
ICML-2003-ConitzerS03a #bound #framework #game studies #named- BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games (VC, TS), pp. 91–98.
KDD-2003-BilenkoM #adaptation #detection #metric #similarity #string #using- Adaptive duplicate detection using learnable string similarity measures (MB, RJM), pp. 39–48.
ICLP-2003-Rao #polynomial- Polynomial-Time Learnability from Entailment (MRKKR), pp. 489–491.
STOC-2002-JacksonKS- Learnability beyond AC0 (JCJ, AK, RAS), pp. 776–784.
ICML-2001-ZhangL #naive bayes- Learnability of Augmented Naive Bayes in Nonimal Domains (HZ, CXL), pp. 617–623.
HCI-EI-1999-PramanaL- Exploring the Learnability of Structured Earcons (EP, YKL), pp. 555–559.
ICML-1999-ParekhH #automaton- Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples (RP, VH), pp. 298–306.
STOC-1996-Bshouty #towards- Towards the Learnability of DNF Formulae (NHB), pp. 131–140.
ICML-1996-Lathrop #on the- On the Learnability of the Uncomputable (RHL), pp. 302–309.
STOC-1994-KearnsMRRSS #on the- On the learnability of discrete distributions (MJK, YM, DR, RR, RES, LS), pp. 273–282.
ICALP-1993-BaligaC #named- Learnability: Admissible, Co-finite, and Hypersimple Languages (GB, JC), pp. 289–300.
CHI-1991-HowesY #predict- Predicting the learnability of task-action mappings (AH, RMY), pp. 113–118.
ICALP-1988-BenedekI- Nonuniform Learnability (GMB, AI), pp. 82–92.
ICALP-1988-KuceraMP #on the- On the Learnability of DNF Formulae (LK, AMS, MP), pp. 347–361.
STOC-1987-KearnsLPV #on the- On the Learnability of Boolean Formulae (MJK, ML, LP, LGV), pp. 285–295.
STOC-1986-BlumerEHW #concept #geometry- Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract) (AB, AE, DH, MKW), pp. 273–282.
STOC-1984-Valiant #formal method- A Theory of the Learnable (LGV), pp. 436–445.