#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2003

2014

- This year (0)
- Last 5 years (5)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Organism

Learn More

- J. G. Sled, Ives R. Levesque, +5 authors G. Bruce Pike
- Magnetic resonance in medicine
- 2004

A quantitative magnetization transfer imaging (qMTI) study, based on a two-pool model of magnetization transfer, was performed on seven normal subjects to determine, on a regional basis, normalâ€¦ (More)

- Srivatsan Narayanan, Vineeta Goel, +4 authors Ketayun Ardeshir Dinshaw
- International journal of radiation oncologyâ€¦
- 2003

PURPOSE
To evaluate the variability in catheter length, geometry, and dosimetric parameters of radical intraoperative high-dose-rate breasts implant during 7-11 days.
METHODS AND MATERIALSâ€¦ (More)

- Venkatesan Guruswami, Srivatsan Narayanan
- Electronic Colloquium on Computational Complexity
- 2012

We prove the following results concerning the combinatorics of list decoding, motivated by the exponential gap between the known upper bound (of O(1/Î³)) and lower bound (of Î©p(log(1/Î³))) for theâ€¦ (More)

- V. Vijayan, Srivatsan Narayanan, P. Kanagasabapathy, Jai Prakash
- 2005 Annual IEEE India Conference - Indicon
- 2005

This paper deals with a method of estimation of robust dead-time for first order plus time delay (FOPTD) process which does not violate the closed loop stability when Proportional-Integral (PI)â€¦ (More)

- T. Vinopraba, N Sivakumaran, N. Selvaganesan, Srivatsan Narayanan
- 2009 International Conference on Advances inâ€¦
- 2009

This brief note considers the problem of stabilizing a first-order plant with dead-time using a fractional order Proportional-Integral-Derivative (PIDÎ±) controller. Fractional order controllerâ€¦ (More)

- Srivatsan Narayanan, Ananth Raghunathan, Pandu Rangan
- 2010

Verifiable Secret Sharing (VSS) is a fundamental primitive used as a bu ilding block in many distributed cryptographic tasks, such as Multiparty Computation and Byzantine Agree ment. VSS is a twoâ€¦ (More)

- Venkatesan Guruswami, Srivatsan Narayanan
- ArXiv
- 2012

We prove the following results concerning the combinatorics of list decoding, motivated by the exponential gap between the known upper bound (of O(1/Î³)) and lower bound (of Î©p(log(1/Î³))) for theâ€¦ (More)

- Srivatsan Narayanan, Ananth Raghunathan, Ramarathnam Venkatesan
- Digital Rights Management Workshop
- 2009

Program Obfuscation that renders any given program essentially equivalent to a black box, while desirable, is impossible [4] in the general polynomial time adversary models. It is natural to searchâ€¦ (More)

Remark 2 We say that a set S has a covering radius at most r if every point in {0, 1}n is inside B(z, r) for some z âˆˆ S. Theorem 1 asserts that the dual code satisfies a relaxed version of theâ€¦ (More)