87 search results - page 10 / 18 » Nearest Singular Polynomials |
ARITH
2009
IEEE
13 years 11 months ago
2009
IEEE
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...
CDC
2009
IEEE
14 years 7 days ago
2009
IEEE
— This paper deals with the class of polynomially uncertain continuous-time linear time-invariant (LTI) systems whose uncertainties belong to a semi-algebraic set. The objective ...
APPML
2007
13 years 7 months ago
2007
We describe a class of inhomogeneous two-dimensional porous medium flows, driven by a finite number of multipole sources; the free boundary dynamics can be parametrized by polyn...
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
SIGMOD
2010
ACM
14 years 10 days ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...