Fitting algebraic curves to noisy data

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 162-169

  Arora, Sanjeev ^a   Khot, Subhash ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CURVE FITTING; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES;

BRUTE FORCE ALGORITHM; POLYNOMIAL TIME ALGORITHM;

COMPUTATIONAL COMPLEXITY;

EID: 0036039020     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509934     Document Type: Conference Paper

References (18)

1. Reconstructing algebraic functions from mixed data
2. A computational approach to edge detection
3. An efficient PAC algorithm for reconstructing a mixture of lines
4. The use of the Hough transformation to detect lines and curves in pictures
5. Markov-Bernstein type inequalities for polynomials under Erdos-type constraints
6. On extremal properties of the derivatives of polynomials
7. An operator which locates edges in digital pictures
8. A survey of the Hough transform
9. Which Hough transform? A survey of Hough transform methods
10. Theory of edge detection
11. An examination of Sir William Hamilton's philosophy, Longman Green, London 1889
12. Decoding of Reed Solomon codes beyond the error-correction bound
13. Deductive learning
14. Error correction of algebraic block codes