Sciweavers

15 search results - page 3 / 3
» Self-Testing Correcting for Polynomials and for Approximate ...
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 9 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
13 years 9 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
PODS
2008
ACM
109views Database» more  PODS 2008»
14 years 5 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
13 years 10 months ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
BMVC
2001
13 years 7 months ago
A Buyer's Guide to Euclidean Elliptical Cylindrical and Conical Surface Fitting
The ability to construct CAD or other object models from edge and range data has a fundamental meaning in building a recognition and positioning system. While the problem of model...
Petko Faber, Robert B. Fisher