279 search results - page 9 / 56 » Matching Polynomials And Duality |
ICCAD
2005
IEEE
14 years 4 months ago
2005
IEEE
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
EJC
2000
13 years 7 months ago
2000
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
DATE
1999
IEEE
13 years 12 months ago
1999
IEEE
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
Abstract—We aim to enhance the end-to-end rate of a general dual-hop relay network with multiple channels and finite modulation formats, by jointly optimizing channel pairing, p...