1132 search results - page 103 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
186
click to vote
DM
2002
15 years 6 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...
175
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
160
click to vote
GLOBECOM
2010
IEEE
15 years 4 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...
133
click to vote
ITC
2003
IEEE
15 years 11 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...
150
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract-- In this paper, we are interested in using largedeviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless sch...