MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Spyros Tragoudas" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 11 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Searching a Pseudo 3-Sided Solid Orthoconvex Grid  
  • by Antonios Symvonis, Spyros Tragoudas — 1993
  • …In this paper we examine the edge searching problem on pseudo 3-sided solid orthoconvex grids. We define a similar problem which we call modified edge searching, and we derive a relation among the original edge searching problem and the modified one. Then, for the modified edge searching problem, w…
  • Add To MetaCart
  • Exact Grading of Multiple Path Delay Faults  
  • by Saravanan Padmanaban, Spyros Tragoudas — 2002
  • …The problem of fault grading for multiple path delay faults is studied and a method of obtaining the exact coverage is presented. The faults covered are represented and manipulated as sets by zero-suppressed binary decision diagrams (ZBDD), which are shown to be able to store a very large number of …
  • Cited by 1 (1 self) – Add To MetaCart
  • On-line testing field programmable analog array circuits  
  • by Haibo Wang, Suchitra Kulkarni, Spyros Tragoudas — in Proc. International Test Conference, 2004
  • …This paper presents an efficient methodology to on-line test field programmable analog array (FPAA) circuits. It proposes to partition the FPAA circuit under test into sub circuits. Each sub circuit is tested by replicating the sub circuit with programmable resources on FPAAs, and comparing the outp…
  • Cited by 1 (0 self) – Add To MetaCart
  • Deterministic Test Pattern Reproduction by a Counter  
  • by Dimitrios Kagaris, Spyros Tragoudas, Amitava Majumdar — 1996 — Proc. Eur. Design & Test Conf
  • …We propose a very simple and fast CAD tool to check whether a binary counter can reproduce a predetermined set of test patterns in a reasonable time. We use provably good algorithms to do column merging, complementation and permutation of the columns of the test matrix so that the distance between t…
  • Cited by 1 (1 self) – Add To MetaCart
  • A security protocol for sensor networks  
  • by Khadija Stewart, Themistoklis Haniotakis, Spyros Tragoudas — 2005 — Proc. IEEE GlobeCom
  • …Abstract — We present in this paper a new security protocol especially suited for sensor networks. This protocol uses a novel encryption method for secure message transmission. We present the details of this encryption scheme along with experimental results performed on a network simulator. I.…
  • Cited by 1 (0 self) – Add To MetaCart
  • An Efficient Algorithm for Finding a Path Subject to Two Additive Constraints  
  • by Turgay Korkmaz, Marwan Krunz, Spyros Tragoudas — 2000 — Computer Communications Journal
  • …One of the key issues in providing end-to-end quality-of-service (QoS) guarantees in packet networks is how to determine a feasible route that satisfies a set of constraints. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem …
  • Cited by 28 (1 self) – Add To MetaCart
  • Cellular Automata for Generating Deterministic Test Sequences  
  • by Dimitrios Kagaris Spyros, Spyros Tragoudas — 1997
  • …We propose an on--chip test pattern generator that uses an one--dimensional cellular automaton (CA) to generate either a precomputed sequence of test patterns or pairs of test patterns for path delay faults. To our knowledge, this is the first approach that guarantees successful on--chip generation …
  • Add To MetaCart
  • Non-Enumerative Path Delay Fault Diagnosis  
  • by Saravanan Padmanaban Spyros, Spyros Tragoudas — 2003 — in Proc. Design, Automation and Test in Europe
  • …The first non-enumerative framework for diagnosing path delay faults using zero suppressed binary decision diagrams is introduced. We show that fault free path delay faults with a validated non-robust test may together with fault free robustly tested faults be used to eliminate faults from the set o…
  • Add To MetaCart
  • Exact Path Delay Fault Coverage with Fundamental Zero-Suppressed BDD Operations  
  • by Saravanan Padmanaban, Maria K. Michael, Spyros Tragoudas — 2002 — Operations, IEEE Trans. on CAD
  • …We formulate the path delay fault grading problem as a combinatorial problem that amounts to storing and manipulating sets on a special type of Binary Decision Diagrams (BDD), called zero-suppressed binary decision diagrams (ZBDD). The zero-suppressed BDD is a canonical data structure inherently hav…
  • Cited by 4 (0 self) – Add To MetaCart
  • Transmissions in a Network with Capacities and Delays  
  • by Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, Christos D. Zaroliagis — 1996
  • …We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non--zero propagation delays. In the absence of delays, the problem has been shown to be solvable in polynomial time. In this paper, we sho…
  • Cited by 1 (0 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB