467 search results - page 56 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
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...
106
click to vote
ICPR
2004
IEEE
16 years 27 days ago
2004
IEEE
The shapes occurring in the images are important in the content-based image retrieval. In this paper we introduce a new Fourier-based descriptor for the characterization of the sh...
TSP
2010
14 years 6 months ago
2010
Using the subband technique, an LTI system can be implemented by the composition of an analysis filterbank, followed by a transfer matrix (subband model) and a synthesis filterbank...
ICIP
2003
IEEE
16 years 1 months ago
2003
IEEE
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...
COCOA
2007
Springer
15 years 6 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...