Kenneth Joseph Ryan

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Mark Vere Culp

> Home > Persons > Kenneth Joseph Ryan

Publications

2019
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/technometrics/CulpRBM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/technometrics/CulpRBM19
Mark Vere Culp, Kenneth Joseph Ryan, Prithish Banerjee, Michael Morehead:
On Data Integration Problems With Manifolds. Technometrics 61(2): 165-175 (2019)
2017
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/infsof/BanerjeeSHCRC17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/infsof/BanerjeeSHCRC17
Sean Banerjee, Zahid A. Syed, Jordan Helmick, Mark Vere Culp, Kenneth Joseph Ryan, Bojan Cukic:
Automated triaging of very large bug repositories. Inf. Softw. Technol. 89: 1-13 (2017)
2015
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/jmlr/RyanC15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jmlr/RyanC15
Kenneth Joseph Ryan, Mark Vere Culp:
On semi-supervised linear regression in covariate shift problems. J. Mach. Learn. Res. 16: 3183-3217 (2015)
2013
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/jmlr/CulpR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jmlr/CulpR13
Mark Vere Culp, Kenneth Joseph Ryan:
Joint harmonic functions and their supervised connections. J. Mach. Learn. Res. 14(1): 3721-3752 (2013)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.