Proceedings., 33rd Annual Symposium on Foundations of Computer Science (1992)
Pittsburgh, PA, USA
Oct. 24, 1992 to Oct. 27, 1992
S. Ar , Princeton Univ., NJ, USA
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.
bivariate polynomial factorization, mixed data, reconstructing algebraic functions, black boxes, same points, computer vision, machine learning, curve fitting, polynomial approximation, self-correcting programs
S. Ar, R. Rubinfeld, M. Sudan and R. Lipton, "Reconstructing algebraic functions from mixed data," Proceedings., 33rd Annual Symposium on Foundations of Computer Science(FOCS), Pittsburgh, PA, USA, 1992, pp. 503-512.