 | 2007 |
|---|
| 13 |       | Geetha Jagannathan,
Krishnan Pillaipakkamnatt,
D. Umano:
A Secure Clustering Algorithm for Distributed Data Streams.
ICDM Workshops 2007: 705-710 |
| 12 | | Michael A. Bender,
Bryan Bradley,
Geetha Jagannathan,
Krishnan Pillaipakkamnatt:
Sum-of-squares heuristics for bin packing and memory allocation.
ACM Journal of Experimental Algorithmics 12: (2007) |
| 2006 |
|---|
| 11 | | Geetha Jagannathan,
Krishnan Pillaipakkamnatt,
Rebecca N. Wright:
A New Privacy-Preserving Distributed k-Clustering Algorithm.
SDM 2006 |
| 2004 |
|---|
| 10 |  | Michael A. Bender,
Bryan Bradley,
Geetha Jagannathan,
Krishnan Pillaipakkamnatt:
The Robustness of the Sum-of-Squares Algorithm for Bin Packing.
ALENEX/ANALC 2004: 18-30 |
| 1998 |
|---|
| 9 | | Krishnan Pillaipakkamnatt,
Dawn Wilkins:
A Tool For Homework Submission Using the World Wide Web.
WebNet 1998 |
| 1997 |
|---|
| 8 | | Dawn Wilkins,
Krishnan Pillaipakkamnatt:
The Effectiveness of Machine Learning Techniques for Predicting Time to Case Disposition.
ICAIL 1997: 106-113 |
| 1996 |
|---|
| 7 | | Lisa Hellerstein,
Krishnan Pillaipakkamnatt,
Vijay V. Raghavan,
Dawn Wilkins:
How Many Queries Are Needed to Learn?
J. ACM 43(5): 840-862 (1996) |
| 6 | | Krishnan Pillaipakkamnatt,
Vijay V. Raghavan:
On the Limits of Proper Learnability of Subclasses of DNF Formulas.
Machine Learning 25(2-3): 237-263 (1996) |
| 5 | | Robert P. Cook,
Krishnan Pillaipakkamnatt:
An Introduction to Opaque Types.
Software - Concepts and Tools 17(1): 1-5 (1996) |
| 1995 |
|---|
| 4 | | Lisa Hellerstein,
Krishnan Pillaipakkamnatt,
Vijay V. Raghavan,
Dawn Wilkins:
How many queries are needed to learn?
STOC 1995: 190-199 |
| 3 | | Krishnan Pillaipakkamnatt,
Vijay V. Raghavan:
Read-Twice DNF Formulas are Properly Learnable.
Inf. Comput. 122(2): 236-267 (1995) |
| 1994 |
|---|
| 2 | | Krishnan Pillaipakkamnatt,
Vijay V. Raghavan:
On the Limits of Proper Learnability of Subclasses of DNF Formulas.
COLT 1994: 118-129 |
| 1993 |
|---|
| 1 | | Krishnan Pillaipakkamnatt,
Vijay V. Raghavan:
A Linear Time Equivalene Test for Read-Twice DNF Formulas.
Inf. Process. Lett. 48(6): 289-295 (1993) |
