 | 2009 |
|---|
| 11 |       | Cameron Johnson,
Ganesh K. Venayagamoorthy,
Pinaki Mitra:
Comparison of a spiking neural network and an MLP for robust identification of generator dynamics in a multimachine power system.
Neural Networks 22(5-6): 833-841 (2009) |
| 2006 |
|---|
| 10 | | Narayanasetty Amarnadh,
Pinaki Mitra:
Upper Bound on Dilation of Triangulations of Cyclic Polygons.
ICCSA (1) 2006: 1-9 |
| 9 | | Pinaki Mitra,
Chitrita Chaudhuri:
Efficient Algorithm for the Extraction of Association Rules in Data Mining.
ICCSA (2) 2006: 1-10 |
| 2003 |
|---|
| 8 |  | Pinaki Mitra,
Asish Mukhopadhyay,
S. V. Rao:
Computing the Closest Point to a Circle.
CCCG 2003: 132-135 |
| 7 | | Pinaki Mitra,
Asish Mukhopadhyay:
Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions.
ICCSA (3) 2003: 787-796 |
| 1998 |
|---|
| 6 | | Pinaki Mitra,
Subhas C. Nandy:
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles.
J. Algorithms 28(2): 315-338 (1998) |
| 1996 |
|---|
| 5 | | Pinaki Mitra,
Subhas C. Nandy:
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles.
FSTTCS 1996: 76-87 |
| 1994 |
|---|
| 4 | | Hossam A. ElGindy,
Pinaki Mitra:
Orthogonal shortest route queries among axis parallel rectangular obstacles.
Int. J. Comput. Geometry Appl. 4(1): 3-24 (1994) |
| 1993 |
|---|
| 3 | | Pinaki Mitra,
Binay K. Bhattacharya:
Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles.
WADS 1993: 518-529 |
| 1992 |
|---|
| 2 | | Pinaki Mitra:
Efficient Parallel Shortest Path Algorithms for K-Chordal Graphs.
IPPS 1992: 88-94 |
| 1 | | Pinaki Mitra:
Answering Gabriel neighbour queries.
Pattern Recognition Letters 13(8): 557-560 (1992) |
