Publications by the members of CSE Department :

Filters Type : Member : Area : Lab:

- A new study for fault-tolerant real-time dynamic scheduling algorithms.

G. Manimaran, C. Siva Ram Murthy

Appeared in*3rd International Conference on High Performance Computing, HIPC 1996, Proceedings, Trivandrum, India, 19-22 December, 1996 (HIPC 1996)*, pp.289-294, Dec 1996. - Velocity Planning for a Robot Moving along the Shortest Straight Line Path Among Moving Obstacles.

Kamala Krithivasan, Anna Rema, Stefan Schirra, P. I. Vijaykumar

Appeared in*Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996*, pp.149-154, Aug 1996. - Neural network models for spotting stop consonant-vowel (SCV) segments in continuous speech.

C. Chandra Sekhar, B. Yegnanarayana

Appeared in*Proceedings of International Conference on Neural Networks (ICNN'96), Washington, DC, USA, June 3-6, 1996*, pp.2003-2008, Jun 1996. - Synchronization Representation and Traffic Source Modeling in Orchestrated Presentation.

S. V. Raghavan, B. Prabhakaran, Satish K. Tripathi

Appeared in*IEEE Journal on Selected Areas in Communications*, Vol 14, pp.104-113, 1996. - A Flexible Traffic Shaper for High Speed Networks: Design and Comparative Study with Leaky Bucket.

S. Radhakrishnan, S. V. Raghavan, Ashok K. Agrawala

Appeared in*Computer Networks and ISDN Systems*, Vol 28, pp.453-469, 1996. - Handling QoS negotiations in orchestrated multimedia presentations.

S. V. Raghavan, B. Prabhakaran, Satish K. Tripathi

Appeared in*J. High Speed Networks*, Vol 5, pp.277-292, 1996. - Security in computer networks and distributed systems.

- On Mapping Production Systems Onto Multiprocessors.

- Optimal Compile-Time Multiprocessor Scheduling Based on the 0-1 Linear Programming Algorithm with the Branch and Bound Technique.

Douglas Antony Louis Piriyakumar, C. Siva Ram Murthy

Appeared in*J. Parallel Distrib. Comput.*, Vol 35, pp.199-204, 1996. - The Parity Path Problem on Some Subclasses of Perfect Graphs.

Satyan R. Coorg, C. Pandu Rangan

Appeared in*Discrete Applied Mathematics*, Vol 68, pp.293-302, 1996. - All-pairs-shortest-length on Strongly Chordal Graphs.

V. Balachandhran, C. Pandu Rangan

Appeared in*Discrete Applied Mathematics*, Vol 69, pp.169-182, 1996. - Clique Transversal and Clique Independence on Comparability Graphs.

V. Balachandran, P. Nagavamsi, C. Pandu Rangan

Appeared in*Inf. Process. Lett.*, Vol 58, pp.181-184, 1996. - Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs.

M. S. Madanlal, G. Venkatesan, C. Pandu Rangan

Appeared in*Inf. Process. Lett.*, Vol 59, pp.97-102, 1996. - Approximate Triclique Coloring for Register Allocation.

- An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph.

- Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph.

K. S. Easwarakumar, S. V. Krishnan, C. Pandu Rangan, S. Seshadri

Appeared in*Algorithmica*, Vol 15, pp.242-255, 1996. - A Memory-Based Hierarchical Planner.

Deepak Khemani, P. V. S. R. Bhanu Prasad

Appeared in*Case-Based Reasoning Research and Development, First International Conference, ICCBR-95, Sesimbra, Portugal, October 23-26, 1995, Proceedings*, Lecture Notes in Computer Science, Vol 1010, pp.501-509, Oct 1995. - Workload Models for Multiwindow Distributed Environments.

S. V. Raghavan, P. J. Joseph

Appeared in*Quantitative Evaluation of Computing and Communication Systems, 8th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, Performance Tools '95, 8th GI/ITG Conference on Measuring, Modeling and Evaluating Computing and Communication Systems, MMB '95, Heidelberg, Germany, September 20-22, 1995, Proceedings*, Lecture Notes in Computer Science, Vol 977, pp.314-326, Sep 1995. - Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees.

V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan

Appeared in*Computing and Combinatorics, First Annual International Conference, COCOON '95, Xi'an, China, August 24-26, 1995, Proceedings*, Lecture Notes in Computer Science, Vol 959, pp.71-80, Aug 1995. - Modeling and simulation of dynamic job scheduling in multiprocessor systems.

Sathi Mahesh, C. Siva Ram Murthy, Timothy A. Gonsalves, C. Pandu Rangan

Appeared in*Int. J. Comput. Math.*, Vol 58, pp.221-247, 1995. - Schema Publishing in X.500 Directory.

- Design and performance study of a flexible traffic shaper for high speed networks.

S. Radhakrishnan, S. V. Raghavan, Ashok K. Agrawala

Appeared in*High Performance Networking VI, IFIP Sixth International Conference on High Performance Networking 1995*, IFIP Conference Proceedings, Vol 29, pp.363-374, Jan 1995. - Hierarchical Approach to Building Generative Networkload Models.

S. V. Raghavan, D. Vasuki Ammaiyar, Gnter Haring

Appeared in*Computer Networks and ISDN Systems*, Vol 27, pp.1193-1206, 1995. - Experience in Test Generation Using Multi-Level Approach.

R. S. Kripanandan, S. V. Raghavan

Appeared in*Computer Networks and ISDN Systems*, Vol 27, pp.591-610, 1995. - Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models.

- Transformation of formants for voice conversion using artificial neural networks.

M. Narendranath, Hema A. Murthy, S. Rajendran, B. Yegnanarayana

Appeared in*Speech Communication*, Vol 16, pp.207-216, 1995. - A New Parallel Algorithm for Solving Sparse Linear Systems.

- A genetic algorithm for the knowledge base partitioning problem.

- A Constant Time Algorithm for Theorem Proving in Propositional Logic on Reconfigurable Meshes.

- A New Modified Gram-schmidt Orthogonal Matrix Factorization Based Algorithm for Parallel Solution of Linear Equations.

K. N. Balasubramanya Murthy, C. Siva Ram Murthy

Appeared in*Parallel Algorithms Appl.*, Vol 6, pp.39-52, 1995. - A note on "task allocation and scheduling models for multiprocessor digital signal processing".

C. S. R. Krishnan, Douglas Antony Louis Piriyakumar, C. Siva Ram Murthy

Appeared in*IEEE Transactions on Signal Processing*, Vol 43, pp.802-805, 1995. - An Efficient Distributed Algorithm For st-numbering The Verices Of A Biconnected Graph

- Optimal Parallel Algorithms for Path Problems on Planar Graphs.

- An Efficient Randomized Algorithm for the Closest Pair Problem on Colored Point Sets.

V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan

Appeared in*Nord. J. Comput.*, Vol 2, pp.28-40, 1995. - Feedback vertex set on cocomparability graphs.

- Efficient Dynamic Job Scheduling Algorithms for Multiprocessor Systems.

Saptarshi Mahesh Prabhakarrao, C. Siva Ram Murthy, C. Pandu Rangan

Appeared in*IEICE Transactions*, Vol 78, pp.3-12, 1995. - Parallel Algorithms on Interval Graphs.

- Edge-disjoint paths in permutation graphs.

C. P. Gopalakrishnan, C. Pandu Rangan

Appeared in*Discussiones Mathematicae Graph Theory*, Vol 15, pp.59-72, 1995. - A linear algorithms for the two paths problem on permutation graphs.

C. P. Gopalakrishnan, C. Pandu Rangan

Appeared in*Discussiones Mathematicae Graph Theory*, Vol 15, pp.147-166, 1995. - Efficient algorithms for minimal disjoint path problems on chordal graphs.

C. P. Gopalakrishnan, C. Pandu Rangan, Satyan R. Coorg

Appeared in*Discussiones Mathematicae Graph Theory*, Vol 15, pp.119-145, 1995. - Performance Bounds for Static Multiprocessor Scheduling of Multi-Task Jobs.

Sathi Mahesh, C. Siva Ram Murthy, C. Pandu Rangan

Appeared in*Parallel Processing Letters*, Vol 5, pp.343-355, 1995. - Weighted Independent Perfect Domination on Cocomparability Graphs.

Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg

Appeared in*Discrete Applied Mathematics*, Vol 63, pp.215-222, 1995. - Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs.

Anand Srinivasan, K. Madhukar, P. Nagavamsi, C. Pandu Rangan, Maw-Shang Chang

Appeared in*Inf. Process. Lett.*, Vol 56, pp.165-171, 1995. - Systematic Design of an Algorithm for Biconnected Components.

K. Madhukar, D. Pavan Kumar, C. Pandu Rangan, R. Sundar

Appeared in*Sci. Comput. Program.*, Vol 25, pp.63-77, 1995. - Efficient Parallel Algorithms for Permutation Graphs.

K. Arvind, V. Kamakoti, C. Pandu Rangan

Appeared in*J. Parallel Distrib. Comput.*, Vol 26, pp.116-124, 1995. - Pitch extraction from root cepstrum.

Hema A. Murthy

Appeared in*The 3rd International Conference on Spoken Language Processing, ICSLP 1994, Yokohama, Japan, September 18-22, 1994 (ICSLP 1994)*, Sep 1994. - Edge-Disjoint Paths in Permutation Graphs.

C. P. Gopalakrishnan, C. Pandu Rangan

Appeared in*Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings*, Lecture Notes in Computer Science, Vol 834, pp.208-216, Aug 1994. - Weighted Irredundance of Interval Graphs.

C. Pandu Rangan, Maw-Shang Chang

Appeared in*Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings*, Lecture Notes in Computer Science, Vol 834, pp.567-574, Aug 1994. - Quality of Service Negotiation for Orchestrated, Distributed Mulitmedia Presentation.

S. V. Raghavan, B. Prabhakaran, Satish K. Tripathi

Appeared in*High Performance Networking V, Proceedings of the IFIP TC6/WG6.4 Fifth International Conference on High Performance Networking, Grenoble, France, 27 June - 1 July, 1994*, IFIP Transactions, pp.219-240, Jun 1994. - Planning with Thematic Actions.

Deepak Khemani

Appeared in*Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, University of Chicago, Chicago, Illinois, USA, June 13-15, 1994*, pp.287-292, Jun 1994.

© 2016 - All Rights Reserved - Dept of CSE, IIT Madras