350 search results - page 30 / 70 » Lower and upper bounds on obtaining history independence |
ITC
2003
IEEE
15 years 5 months ago
2003
IEEE
Intermittent scan chain hold-time fault is discussed in this paper and a method to diagnose the faulty site in a scan chain is proposed as well. Unlike the previous scan chain dia...
101
click to vote
DM
2002
14 years 11 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
GLOBECOM
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper, we study the diversity-multiplexing tradeoff (DMT) of two-way relay channels (TWRC) with multiantenna relay at finite signal-to-noise ratio (SNR). A two-phase decode...
104
click to vote
RP
2009
Springer
15 years 6 months ago
2009
Springer
We present an abstraction of the probabilistic semantics of Multiset Rewriting to formally express systems of reactions with uncertain kinetic rates. This allows biological systems...
100
click to vote
JSAC
2006
14 years 11 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...