Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1109/SFCS.1992.267801guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Reconstructing algebraic functions from mixed data

Published: 24 October 1992 Publication History

Abstract

The authors consider the task of reconstructing algebraic functions given by black boxes. Unlike traditional settings, they are interested in black boxes which represent several algebraic functions-f/sub 1/, . . ., f/sub k/, where at each input x, the box arbitarrily chooses a subset of f/sub 1/(x), . . ., f/sub k/(x) to output. They show how to reconstruct the functions f/sub 1/,. . ., f/sub k/ from the black box. This allows them to group the same points into sets, such that for each set, all outputs to points in the set are from the same algebraic function. The methods are robust in the presence of errors in the black box. The model and techniques can be applied in the areas of computer vision, machine learning, curve fitting and polynomial approximation, self-correcting programs and bivariate polynomial factorization.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
SFCS '92: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
October 1992
731 pages
ISBN:0818629002

Publisher

IEEE Computer Society

United States

Publication History

Published: 24 October 1992

Author Tags

  1. bivariate polynomial factorization
  2. black boxes
  3. computer vision
  4. curve fitting
  5. machine learning
  6. mixed data
  7. polynomial approximation
  8. reconstructing algebraic functions
  9. same points
  10. self-correcting programs

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2018)Big data interpolation using functional representationActa Informatica10.5555/3204178.320422055:3(213-225)Online publication date: 1-May-2018
  • (2002)Tradeoffs in probabilistic packet marking for IP tracebackProceedings of the thiry-fourth annual ACM symposium on Theory of computing10.1145/509907.509969(407-418)Online publication date: 19-May-2002
  • (2001)A displacement approach to decoding algebraic codesContemporary mathematics10.5555/1139327.1139342(265-292)Online publication date: 1-Aug-2001
  • (1999)Sparse sets, approximable sets, and parallel queries to NPProceedings of the 16th annual conference on Theoretical aspects of computer science10.5555/1764891.1764927(281-290)Online publication date: 4-Mar-1999
  • (1999)On the hardness of permanentProceedings of the 16th annual conference on Theoretical aspects of computer science10.5555/1764891.1764903(90-99)Online publication date: 4-Mar-1999
  • (1999)On Membership Comparable SetsJournal of Computer and System Sciences10.1006/jcss.1999.165359:2(270-280)Online publication date: 1-Oct-1999
  • (1997)Decoding of Reed Solomon Codes beyond the Error-Correction BoundJournal of Complexity10.1006/jcom.1997.043913:1(180-193)Online publication date: 1-Mar-1997
  • (1993)Occam's razor for functionsProceedings of the sixth annual conference on Computational learning theory10.1145/168304.168380(370-376)Online publication date: 1-Aug-1993
  • (1993)Learning sparse multivariate polynomials over a field with queries and counterexamplesProceedings of the sixth annual conference on Computational learning theory10.1145/168304.168307(17-26)Online publication date: 1-Aug-1993

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media