2008 |
11 | EE | Saurabh Garg,
Karali Patra,
Surjya K. Pal,
Debabrata Chakraborty:
Effect of different basis functions on a radial basis function network in prediction of drill flank wear from motor current signals.
Soft Comput. 12(8): 777-787 (2008) |
2007 |
10 | EE | Saurabh Garg,
Jayanthi Sivaswamy,
Siva Chandra:
Unsupervised Curvature-Based Retinal Vessel Segmentation.
ISBI 2007: 344-347 |
9 | EE | Gopal Datt Joshi,
Saurabh Garg,
Jayanthi Sivaswamy:
A generalised framework for script identification.
IJDAR 10(2): 55-68 (2007) |
8 | EE | Saurabh Garg,
Surjya K. Pal,
Debabrata Chakraborty:
Evaluation of the performance of backpropagation and radial basis function neural networks in predicting the drill flank wear.
Neural Computing and Applications 16(4-5): 407-417 (2007) |
2006 |
7 | EE | Gopal Datt Joshi,
Saurabh Garg,
Jayanthi Sivaswamy:
Script Identification from Indian Documents.
Document Analysis Systems 2006: 255-267 |
2005 |
6 | EE | Ahmed Helmy,
Saurabh Garg,
Nitin Nahata,
Priyatham Pamu:
CARD: A Contact-based Architecture for Resource Discovery in Wireless Ad Hoc Networks.
MONET 10(1-2): 99-113 (2005) |
2004 |
5 | | Leila Taher,
Oliver Rinner,
Saurabh Garg,
Alexander Sczyrba,
Burkhard Morgenstern:
AGenDA: gene prediction by cross-species sequence comparison.
Nucleic Acids Research 32(Web-Server-Issue): 305-308 (2004) |
2003 |
4 | EE | Ahmed Helmy,
Saurabh Garg,
Priyatham Pamu,
Nitin Nahata:
Contact-Based Architecture for Resource Discovery (CARD) in Large Scale MANets.
IPDPS 2003: 219 |
3 | | Leila Taher,
Oliver Rinner,
Saurabh Garg,
Alexander Sczyrba,
Michael Brudno,
Serafim Batzoglou,
Burkhard Morgenstern:
AGenDA: homology-based gene prediction.
Bioinformatics 19(12): 1575-1577 (2003) |
2002 |
2 | EE | Saurabh Garg,
Priyatham Pamu,
Nitin Nahata,
Ahmed Helmy:
Contact-Based Architecture for Resource Discovery (CARD) in Large Scale MANets
CoRR cs.NI/0208024: (2002) |
1 | EE | Nitin Nahata,
Priyatham Pamu,
Saurabh Garg,
Ahmed Helmy:
Efficient resource discovery for large scale ad hoc networks using contacts.
Computer Communication Review 32(3): 32 (2002) |