R. Sundaram

Publication List Details

Period

1994 - 2007

Number

22

Co-Authors

Structural health monitoring of co-cured composite structures using FBG sensors (2005)

Sundaram, R, Gupta, N, Rao, MS

Structural Health Monitoring (SHM) of aircraft structures, especially composite structures, has assumed increased significance on considerations of safety and costs. With the advent of co-cured...

Isip 2000 Conversational Speech Evaluation System (2000)

R. Sundaram, A. Ganapathiraju, J. Hamaker, J. Picone

In this paper, we describe the ISIP Automatic Speech Recognition system (ISIP-ASR) used for the Hub-5 2000 English evaluations. The system is a public domain cross-word context-dependent HMM based...

Alternation in Interaction (1999)

M. Kiwi, Mit U. Chile, C. Lund, A. Russell, D. Spielman, R. Sundaram

We study competing-prover one-round interactive proof systems. We show that one-round proof systems in which the first prover is trying to convince a verifier to accept and the second prover is...

Improving Minimum Cost Spanning Trees by Upgrading Nodes (1999)

S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, ...

We study budget constrained network upgrading problems. We are given an undirected edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the weight...

Improving Spanning Trees by Upgrading Nodes (1998)

M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, H. C. Wirth

. We study budget constrained optimal network upgrading problems. We are given an edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delay of...

Improving Spanning Trees by Upgrading Nodes (1998)

M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, H. C. Wirth

. We study budget constrained optimal network upgrading problems. We are given an edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delay of...

Alternation in Interaction (1997)

M. Kiwi, Mit U. Chile, C. Lund, A. Russell, D. Spielman, R. Sundaram

We study competing-prover one-round interactive proof systems. We show that one-round proof systems in which the first prover is trying to convince a verifier to accept and the second prover is...

Spanning trees short or small (1994)

Ravi, R., Sundaram, R., Marathe, Madhav V., Ravi, S. S., Rosenkrantz, Daniel J.

We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number $k$ of nodes are required to be connected in...

Improving Minimum Cost Spanning Trees by Upgrading Nodes (1970)

S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, ...

We study budget constrained network upgrading problems. We are given an undirected edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the weight...

Spanning Trees Short Or Small (1970)

R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, S. S. Ravi

We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number k of nodes are required to be connected in...

Costly Financing, Optimal Payout Policies and the Valuation of Corporate Debt

V. Acharya, J. Huang, Marti G. Subrahmanyam, R. Sundaram

We present a cash-flow based model of corporate debt valuation that incorporates two novel features. First, we allow for the separation and optimal determination of the firm's debt-service and...