2766 search results - page 120 / 554 » Algorithms for trigonometric polynomials |
147
click to vote
SMA
2010
ACM
15 years 4 months ago
2010
ACM
We present an algorithm which robustly computes the intersection curve(s) of an under-constrained piecewise polynomial system consisting of n equations with n + 1 unknowns. The so...
130
click to vote
ECCC
2006
15 years 3 months ago
2006
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...
139
click to vote
DAC
2011
ACM
14 years 3 months ago
2011
ACM
Stochastic device noise has become a significant challenge for high-precision analog/RF circuits, and it is particularly difficult to correctly include both white noise and flic...
130
Voted
ICCV
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
107
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...