|
Search the dblp DataBase
Krishnan Pillaipakkamnatt:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt
The Robustness of the Sum-of-Squares Algorithm for Bin Packing. [Citation Graph (0, 0)][DBLP] ALENEX/ANALC, 2004, pp:18-30 [Conf]
- Krishnan Pillaipakkamnatt, Vijay V. Raghavan
On the Limits of Proper Learnability of Subclasses of DNF Formulas. [Citation Graph (0, 0)][DBLP] COLT, 1994, pp:118-129 [Conf]
- Dawn Wilkins, Krishnan Pillaipakkamnatt
The Effectiveness of Machine Learning Techniques for Predicting Time to Case Disposition. [Citation Graph (0, 0)][DBLP] ICAIL, 1997, pp:106-113 [Conf]
- Geetha Jagannathan, Krishnan Pillaipakkamnatt, Rebecca N. Wright
A New Privacy-Preserving Distributed k-Clustering Algorithm. [Citation Graph (0, 0)][DBLP] SDM, 2006, pp:- [Conf]
- Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins
How many queries are needed to learn? [Citation Graph (0, 0)][DBLP] STOC, 1995, pp:190-199 [Conf]
- Krishnan Pillaipakkamnatt, Dawn Wilkins
A Tool For Homework Submission Using the World Wide Web. [Citation Graph (0, 0)][DBLP] WebNet, 1998, pp:- [Conf]
- Krishnan Pillaipakkamnatt, Vijay V. Raghavan
Read-Twice DNF Formulas are Properly Learnable. [Citation Graph (0, 0)][DBLP] Inf. Comput., 1995, v:122, n:2, pp:236-267 [Journal]
- Krishnan Pillaipakkamnatt, Vijay V. Raghavan
A Linear Time Equivalene Test for Read-Twice DNF Formulas. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1993, v:48, n:6, pp:289-295 [Journal]
- Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay V. Raghavan, Dawn Wilkins
How Many Queries Are Needed to Learn? [Citation Graph (0, 0)][DBLP] J. ACM, 1996, v:43, n:5, pp:840-862 [Journal]
- Krishnan Pillaipakkamnatt, Vijay V. Raghavan
On the Limits of Proper Learnability of Subclasses of DNF Formulas. [Citation Graph (0, 0)][DBLP] Machine Learning, 1996, v:25, n:2-3, pp:237-263 [Journal]
- Robert P. Cook, Krishnan Pillaipakkamnatt
An Introduction to Opaque Types. [Citation Graph (0, 0)][DBLP] Software - Concepts and Tools, 1996, v:17, n:1, pp:1-5 [Journal]
- Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt
Sum-of-squares heuristics for bin packing and memory allocation. [Citation Graph (0, 0)][DBLP] ACM Journal of Experimental Algorithms, 2007, v:12, n:, pp:- [Journal]
A Secure Clustering Algorithm for Distributed Data Streams. [Citation Graph (, )][DBLP]
A Practical Differentially Private Random Decision Tree Classifier. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|