article A Polynomial Time Algorithm for 3SAT ACM Transactions on Computation Theory September 2021 Article No.: 15, pp 1–13 https://doi.org/10.1145/3460950Online:18 July 2021Publication History 0citation412DownloadsMetricsTotal Citations0Total Downloads412Last 12 Months412Last 6 weeks0

We propose a novel technique for robust voiced/unvoiced segment detection in noisy speech, based on local polynomial regression. The local polynomial model is well-suited for voiced segments in speech. The unvoiced segments are noise-like and do not exhibit any smooth structure. This property of smoothness is used for devising a new metric called the variance ratio metric, which, after threshol...

We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to improve the scattered data fitting algorithm of [7]. Similar to that algorithm, the new method has linear computational complexity and is therefore suitable for large real world data. Numerical examples suggest that it can produce high quality artifact–free approximations that are more ...

augmented downhill simplex method (adsm) is introduced here, that is a heuristic combination of downhill simplex method (dsm) with random search algorithm. in fact, dsm is an interpretable nonlinear local optimization method. however, it is a local exploitation algorithm; so, it can be trapped in a local minimum. in contrast, random search is a global exploration, but less efficient. here, rand...

We investigate how to factorize a multivariate polynomial matrix into the product of two matrices. There are two major parts. The first is a factorization theorem, which asserts that a multivariate polynomial matrix whose lower order minors satisfy certain conditions admits a matrix factorization. Our theory is a generalization to the previous results given by Lin et.al [16] and Liu et.al [17]....