653 search results - page 60 / 131 » The size of minimum 3-trees |
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
DAC
2007
ACM
16 years 26 days ago
2007
ACM
In this paper, we propose TROY, the first track router with yield-driven wire planning to optimize yield loss due to random defects. As the probability of failure (POF) computed f...
DAC
1998
ACM
16 years 25 days ago
1998
ACM
The logic blocks CLBs of a lookup table LUT based FPGA consist of one or more LUTs, possibly of di erent sizes. In this paper, we focus on technology mapping for CLBs with several...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
143
click to vote
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
—Enhanced distributed channel access (EDCA) is the basis protocol in IEEE 802.11e protocol suite. It is used for providing differentiated quality of service (QoS) in IEEE 802.11e...