Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks (1995)
Marek Karpinski Dept, Marek Karpinski, Angus Macintyre
. We introduce a new method for proving explicit upper bounds on the VC Dimension of general functional basis networks, and prove as an application, for the first time, the VC Dimension of analog...
On a Sublinear Time Parallel Construction of Optimal Binary Search Trees (Note) (1994)
Marek Karpinski Dept, Marek Karpinski, Wojciech Rytter
We design an efficient sublinear time parallel construction of optimal binary search trees. The efficiency of the parallel algorithm corresponds to its total work (the product time \Theta...