2430 search results - page 96 / 486 » Computing Tutte Polynomials |
141
click to vote
JC
2000
15 years 4 months ago
2000
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
145
click to vote
ICIP
2002
IEEE
16 years 6 months ago
2002
IEEE
In this paper we introduce the DCT-mod2 facial feature extraction technique which utilizes polynomial coefficients derived from 2-D DCT coefficients of spatially neighbouring bloc...
127
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
—In this paper we propose an interference detection technique for detecting time varying jamming signals in spread spectrum communication systems. The technique is based on Discr...
188
click to vote
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
193
click to vote
COCO
1997
Springer
15 years 9 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...