3415 search results - page 317 / 683 » Lower bounds on kernelization |
141
click to vote
GLVLSI
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper proposes a new fault coverage estimation model which can be used in the early stage of VLSI design. The fault coverage model is an exponentially decaying function with ...
197
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...
190
click to vote
QCQC
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
170
click to vote
CSFW
1996
IEEE
15 years 11 months ago
1996
IEEE
: This paper examines some of the theoretical foundations of the distributable change detection method introduced by Forrest et al. in [10], including fundamental bounds on some of...
177
click to vote
CIAC
1997
Springer
15 years 11 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...