87 search results - page 3 / 18 » Nearest Singular Polynomials |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
IMAMS
2007
13 years 9 months ago
2007
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...
VISUALIZATION
1997
IEEE
13 years 11 months ago
1997
IEEE
We present an algorithm for the visualization of vector field topology based on Clifford algebra. It is the first method allowing the detection of higher order singularities. Th...
INFORMATICALT
2008
13 years 7 months ago
2008
Abstract. A possibility to use the formant features (FF) in the user-dependent isolated word recognition has been investigated. The word recognition was performed using a dynamic t...
FOCM
2010
13 years 6 months ago
2010
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We...