A Novel Data-Path for Accelerating DSP Kernels † (2008)
M. D. Galanis, G. Theodoridis, S. Tragoudas, D. Soudris, C. E. Goutis
Abstract. A high-performance data-path to implement DSP kernels is proposed in this paper. The data-path is based on a flexible, universal, and regular component that allows to optimally exploiting...
P. Klein, F. T. Leighton, F. Makedon, C. Stein, C. Stein, S. Tragoudas, ...
E. Tardos. Fast approximation algorithms fpr fractional packing and covering problems. In FOCS '91. [9] S.K. Sahni. Algorithms for scheduling independent tasks. J. Assoc. Comput. Mach.,
Implicit and Exact Path Delay Fault Grading in Sequential Circuits (2005)
Kumar, M. M. Vaseekar, Tragoudas, S., Chakravarty, S., Jayabharathi, R.
The first path implicit and exact non-robust path delay fault grading technique for non-scan sequential circuits is presented. Non enumerative exact coverage is obtained, by allowing any latched...
Implicit and Exact Path Delay Fault Grading in Sequential Circuits (2005)
Kumar, M. M. Vaseekar, Tragoudas, S., Chakravarty, S., Jayabharathi, R.
The first path implicit and exact non-robust path delay fault grading technique for non-scan sequential circuits is presented. Non enumerative exact coverage is obtained, by allowing any latched...
A reconfigurable coarse-grain data-path for accelerating computational intensive kernels (2005)
M. D. Galanis, G. Theodoridis, S. Tragoudas, C. E. Goutis
In this paper, a high-performance reconfigurable coarse-grain data-path, part of a hybrid reconfigurable platform, is introduced. The data-path consists of coarse-grain components that their...
ATPG Tools for Delay Faults at the Functional Level (2002)
Abstract We propose and evaluate two frameworks for functional level ATPG for delay faults in combinational circuits. Although functional delay fault models have been recently proposed [9, 13, 10],...
Fast Approximation Algorithms for Multicommodity Flow Problems (1995)
Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, E., Tragoudas, S.
Fast Approximation Algorithms for Multicommodity Flow Problems
Fast Approximation Algorithms for Multicommodity Flow Problems (1995)
Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, E., Tragoudas, S.
Fast Approximation Algorithms for Multicommodity Flow Problems
Fast approximation algorithms for multicommodity flow problems (1991)
Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, E., Tragoudas, S.
This paper published in "Mathematical Programming" 65 (1994), 217-245
Fast approximation algorithms for multicommodity flow problems (1991)
Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, E., Tragoudas, S.
This paper published in "Mathematical Programming" 65 (1994), 217-245