We present a PTAS for agnostically learning halfspaces w.r.t. the uniform distribution on the d dimensional sphere. Namely, we show that for every μ > 0 there is an algorithm that runs in time poly ( d, 1 ) , and is guaranteed to return a classifier with error at most (1 + μ)opt + , where opt is the error of the best halfspace classifier. This improves on Awasthi, Balcan and Long [2] who showed...

Let f be analytic on the compact set E ⊂ C , of positive transfinite diameter and let Cr denote the largest equipotential curve of E such that f is analytic within Cr. Generally, the growth of an entire function is measured in terms of its order and type. Here we have established the relations between maximum modulus, maximum term and interpolation error of best uniform approximation to a funct...

the gravity recovery and climate experiment (grace), twin satellites launched in march 2002, are making detailed measurements of the earth's gravity field. it will yield discoveries about gravity and the earth's natural systems. different sensors and instruments have been placed in the grace satellites to fulfill the primary scientific objective of the mission in mapping the earth’s g...

in this paper we introduce the root of a fuzzy number, and we present aniterative method to nd it, numerically. we present an algorithm to generatea sequence that can be converged to n-th root of a fuzzy number.

In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation scheme for the case where the due dates are uniform within a family. 2007 Elsevier Ltd. All rights reserved.

In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hypergraphs. Our method is based on a generalization of the canonical path method to the case of uniform hypergraphs.