Krishnan Pillaipakkamnatt - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2019

Automatic Classification of Rhetorical Roles for Sentences: Comparing Rule-Based Scripts with Machine LearningVern R. Walker, Krishnan Pillaipakkamnatt, Alexandra M. Davidson, Marysa Linares, Domenick J. Pesce. icail 2019: [doi]

2018

Using Morphemes from Agglutinative Languages like Quechua and Finnish to Aid in Low-Resource TranslationJohn Ortega, Krishnan Pillaipakkamnatt. amta 2018: 1-11 [doi]

2013

A Semi-Supervised Learning Approach to Differential PrivacyGeetha Jagannathan, Claire Monteleoni, Krishnan Pillaipakkamnatt. icdm 2013: 841-848 [doi]

2012

A Practical Differentially Private Random Decision Tree ClassifierGeetha Jagannathan, Krishnan Pillaipakkamnatt, Rebecca N. Wright. tdp, 5(1):273-295, 2012. [doi]

2010

Communication-Efficient Privacy-Preserving ClusteringGeetha Jagannathan, Krishnan Pillaipakkamnatt, Rebecca N. Wright, Daryl Umano. tdp, 3(1):1-25, 2010. [doi]

2009

A Practical Differentially Private Random Decision Tree ClassifierGeetha Jagannathan, Krishnan Pillaipakkamnatt, Rebecca N. Wright. icdm 2009: 114-121 [doi]

2007

Sum-of-squares heuristics for bin packing and memory allocationMichael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt. jea, 12, 2007. [doi]

A Secure Clustering Algorithm for Distributed Data StreamsGeetha Jagannathan, Krishnan Pillaipakkamnatt, D. Umano. icdm 2007: 705-710 [doi]

2006

A New Privacy-Preserving Distributed k-Clustering AlgorithmGeetha Jagannathan, Krishnan Pillaipakkamnatt, Rebecca N. Wright. sdm 2006: 494-498 [doi]

2004

The Robustness of the Sum-of-Squares Algorithm for Bin PackingMichael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt. alenex 2004: 18-30

1998

A Tool For Homework Submission Using the World Wide WebKrishnan Pillaipakkamnatt, Dawn Wilkins. webnet 1998:

1997

The Effectiveness of Machine Learning Techniques for Predicting Time to Case DispositionDawn Wilkins, Krishnan Pillaipakkamnatt. icail 1997: 106-113 [doi]

1996

An Introduction to Opaque TypesRobert P. Cook, Krishnan Pillaipakkamnatt. stp, 17(1):1-5, 1996.

How Many Queries Are Needed to Learn?Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins. JACM, 43(5):840-862, 1996. [doi]

On the Limits of Proper Learnability of Subclasses of DNF FormulasKrishnan Pillaipakkamnatt, Vijay V. Raghavan. ml, 25(2-3):237-263, 1996.

1995

How many queries are needed to learn?Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins. stoc 1995: 190-199 [doi]

Read-Twice DNF Formulas are Properly LearnableKrishnan Pillaipakkamnatt, Vijay V. Raghavan. iandc, 122(2):236-267, 1995.

1994

On the Limits of Proper Learnability of Subclasses of DNF FormulasKrishnan Pillaipakkamnatt, Vijay V. Raghavan. colt 1994: 118-129 [doi]

1993

A Linear Time Equivalene Test for Read-Twice DNF FormulasKrishnan Pillaipakkamnatt, Vijay V. Raghavan. ipl, 48(6):289-295, 1993.

Read-twice DNF formulas are properly learnableKrishnan Pillaipakkamnatt, Vijay Raghavan 0002. eurocolt 1994: 121-132

Sign in or sign up to see more results.

runs on WebDSL