Follow
Krishnan Pillaipakkamnatt
Krishnan Pillaipakkamnatt
Verified email at hofstra.edu
Title
Cited by
Cited by
Year
A practical differentially private random decision tree classifier
G Jagannathan, K Pillaipakkamnatt, RN Wright
2009 IEEE international conference on data mining workshops, 114-121, 2009
2462009
A New Privacy-Preserving Distributed k-Clustering Algorithm
G Jagannathan, K Pillaipakkamnatt, RN Wright
Proceedings of the 2006 SIAM international conference on data mining, 494-498, 2006
1642006
How many queries are needed to learn?
L Hellerstein, K Pillaipakkamnatt, V Raghavan, D Wilkins
Journal of the ACM (JACM) 43 (5), 840-862, 1996
1571996
On the limits of proper learnability of subclasses of DNF formulas
K Pillaipakkamnatt, V Raghavan
Proceedings of the seventh annual conference on Computational learning …, 1994
431994
The effectiveness of machine learning techniques for predicting time to case disposition
D Wilkins, K Pillaipakkamnatt
Proceedings of the 6th international conference on Artificial intelligence …, 1997
331997
Communication-efficient privacy-preserving clustering.
G Jagannathan, K Pillaipakkamnatt, RN Wright, D Umano
Trans. Data Priv. 3 (1), 1-25, 2010
312010
Read-twice DNF formulas are properly learnable
K Pillaipakkamnatt, V Raghavan
Information and Computation 122 (2), 236-267, 1995
301995
A semi-supervised learning approach to differential privacy
G Jagannathan, C Monteleoni, K Pillaipakkamnatt
2013 IEEE 13th International Conference on Data Mining Workshops, 841-848, 2013
292013
Read-twice DNF formulas are properly learnable
K Pillaipakkamnatt, V Raghavan
Proceedings of the first European conference on Computational learning …, 1994
161994
A secure clustering algorithm for distributed data streams
G Jagannathan, K Pillaipakkamnatt, D Umano
Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007 …, 2007
82007
Sum-of-squares heuristics for bin packing and memory allocation
MA Bender, B Bradley, G Jagannathan, K Pillaipakkamnatt
Journal of Experimental Algorithmics (JEA) 12, 1-19, 2008
62008
A linear time equivalence test for read-twice DNF formulas
K Pillaipakkamnatt, V Raghavan
Information processing letters 48 (6), 289-295, 1993
51993
The Robustness of the Sum-of-Squares Algorithm for Bin Packing.
MA Bender, B Bradley, G Jagannathan, K Pillaipakkamnatt
ALENEX/ANALC, 18-30, 2004
12004
Proper learnability of Boolean formulas in disjunctive normal form
K Pillaipakkamnatt
Vanderbilt University, 1995
11995
An introduction to opaque types
RP Cook, K Pillaipakkamnatt
Software-Concepts and Tools 17 (1), 1-5, 1996
1996
The system can't perform the operation now. Try again later.
Articles 1–15