Sciweavers

4218 search results - page 234 / 844
» Complete sets of cooperations
Sort
View
EURODAC
1994
IEEE
148views VHDL» more  EURODAC 1994»
15 years 10 months ago
BiTeS: a BDD based test pattern generator for strong robust path delay faults
This paper presents an algorithm for generation of test patterns for strong robust path delay faults, i.e. tests that propagate the fault along a single path and additionally are ...
Rolf Drechsler
VLDB
1994
ACM
102views Database» more  VLDB 1994»
15 years 10 months ago
Reasoning About Spatial Relationships in Picture Retrieval Systems
In this paper, we consider various spatial relationships that are of general interest in pictorial database systems. We present a set of rules that allow us to deduce new relation...
A. Prasad Sistla, Clement T. Yu, R. Haddad
DM
2010
128views more  DM 2010»
15 years 6 months ago
Some remarks on the geodetic number of a graph
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
Mitre Costa Dourado, Fábio Protti, Dieter R...
ARSCOM
2002
69views more  ARSCOM 2002»
15 years 5 months ago
On Deuber's partition theorem for (m, p, c)-sets
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
David S. Gunderson
ET
1998
52views more  ET 1998»
15 years 5 months ago
Scalable Test Generators for High-Speed Datapath Circuits
This paper explores the design of efficient test sets and test-pattern generators for online BIST. The target applications are high-performance, scalable datapath circuits for whi...
Hussain Al-Asaad, John P. Hayes, Brian T. Murray