Kearns

Results: 222



#Item
31Learning from Multiple Sources  Koby Crammer, Michael Kearns, Jennifer Wortman Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104

Learning from Multiple Sources Koby Crammer, Michael Kearns, Jennifer Wortman Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104

Add to Reading List

Source URL: www.jennwv.com

Language: English - Date: 2013-08-25 22:35:26
    32Learning from Collective Behavior  Michael Kearns Computer and Information Science University of Pennsylvania

    Learning from Collective Behavior Michael Kearns Computer and Information Science University of Pennsylvania

    Add to Reading List

    Source URL: www.jennwv.com

    Language: English - Date: 2013-08-25 22:35:26
      33Learning from Data of Variable Quality  Koby Crammer, Michael Kearns, Jennifer Wortman Computer and Information Science University of Pennsylvania Philadelphia, PA 19103

      Learning from Data of Variable Quality Koby Crammer, Michael Kearns, Jennifer Wortman Computer and Information Science University of Pennsylvania Philadelphia, PA 19103

      Add to Reading List

      Source URL: www.jennwv.com

      Language: English - Date: 2013-08-25 22:35:26
        34Sponsored Search with Contexts Eyal Even-Dar, Michael Kearns, and Jennifer Wortman Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104

        Sponsored Search with Contexts Eyal Even-Dar, Michael Kearns, and Jennifer Wortman Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104

        Add to Reading List

        Source URL: www.jennwv.com

        Language: English - Date: 2013-08-25 22:35:26
          35Risk-Sensitive Online Learning Eyal Even-Dar, Michael Kearns, and Jennifer Wortman Department of Computer and Information Science University of Pennsylvania, Philadelphia, PAAbstract. We consider the problem of o

          Risk-Sensitive Online Learning Eyal Even-Dar, Michael Kearns, and Jennifer Wortman Department of Computer and Information Science University of Pennsylvania, Philadelphia, PAAbstract. We consider the problem of o

          Add to Reading List

          Source URL: www.jennwv.com

          Language: English - Date: 2013-08-25 22:35:26
            36Efficient Noise-Tolerant Learning from Statistical Queries MICHAEL KEARNS AT&T Laboratories—Research, Florham Park, New Jersey  Abstract. In this paper, we study the problem of learning in the presence of classificatio

            Efficient Noise-Tolerant Learning from Statistical Queries MICHAEL KEARNS AT&T Laboratories—Research, Florham Park, New Jersey Abstract. In this paper, we study the problem of learning in the presence of classificatio

            Add to Reading List

            Source URL: homepages.math.uic.edu

            Language: English - Date: 2014-10-15 12:44:32
              37Learning To Pick Up a Novel Object  Chioma Osondu and Justin Kearns 1. Abstract In order for an autonomous robot to successfully

              Learning To Pick Up a Novel Object Chioma Osondu and Justin Kearns 1. Abstract In order for an autonomous robot to successfully

              Add to Reading List

              Source URL: cs229.stanford.edu

              Language: English - Date: 2011-09-14 20:33:03
                38Microsoft Word - FLSA Basics-Kearns 2005.doc

                Microsoft Word - FLSA Basics-Kearns 2005.doc

                Add to Reading List

                Source URL: www.americanbar.org

                Language: English - Date: 2013-03-21 13:59:15
                  39Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation Michael Kearns AT&T Labs Research Murray Hill, New Jersey

                  Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation Michael Kearns AT&T Labs Research Murray Hill, New Jersey

                  Add to Reading List

                  Source URL: www.cis.upenn.edu

                  Language: English - Date: 2001-02-22 11:56:39
                    40Approximate Planning in Large POMDPs via Reusable Trajectories Michael Kearns  AT&T Labs

                    Approximate Planning in Large POMDPs via Reusable Trajectories Michael Kearns  AT&T Labs

                    Add to Reading List

                    Source URL: www.cis.upenn.edu

                    Language: English - Date: 2001-02-22 12:01:04