Asim K. Pal Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2007
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRamasubramanian Sundararajan, Asim K. Pal: Rejection schemes for graded multiclass problems. Artificial Intelligence and Applications 2007: 434-439
2005
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSatish K. Sehgal, Asim K. Pal: Privacy Preserving Decentralized Method for Computing a Pareto-Optimal Solution. IWDC 2005: 578-583
2004
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRamasubramanian Sundararajan, Asim K. Pal: Learning with an Embedded Reject Option: A Statistical Learning Theory Perspective. ICAISC 2004: 664-669
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSatish K. Sehgal, Asim K. Pal: Finding Pareto-Optimal Set of Distributed Vectors with Minimum Disclosure. IWDC 2004: 144-149
1997
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmbuj Mahanti, Subrata Ghosh, Dana S. Nau, Asim K. Pal, Laveen N. Kanal: On the Asymptotic Performance of IDA*. Ann. Math. Artif. Intell. 20(1-4): 161-193 (1997)
1992
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmbuj Mahanti, Subrata Ghosh, Dana S. Nau, Asim K. Pal, Laveen N. Kanal: Performance of IDA on Trees and Graphs. AAAI 1992: 539-544
1984
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAsim K. Pal, A. Bagchi: On the Mean Weight Balance Factor of Binary Trees. FSTTCS 1984: 419-434

Coauthor Index

1A. Bagchi [1]
2Subrata Ghosh [2] [3]
3Laveen N. Kanal [2] [3]
4Ambuj Mahanti [2] [3]
5Dana S. Nau [2] [3]
6Satish K. Sehgal [4] [6]
7Ramasubramanian Sundararajan [5] [7]

Colors in the list of coauthors

Copyright © Thu Dec 17 16:12:58 2009 by Michael Ley (ley@uni-trier.de)