425 search results - page 36 / 85 » Polynomial Factorization 1987-1991 |
ICPR
2010
IEEE
13 years 8 months ago
2010
IEEE
Pitch mismatch between training and testing is one of the important factors causing the performance degradation of the speaker recognition system. In this paper, we adopted the mis...
SIAMCOMP
2011
13 years 1 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
AAAI
2012
12 years 1 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
DAC
2009
ACM
14 years 5 months ago
2009
ACM
In this paper we present a continuous surface model to describe the interconnect geometric variation, which improves the currently used model for better accuracy while not increas...
FOCS
2008
IEEE
14 years 5 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...