Conventional search engines nd Web pages by using keyword matching. Two disadvantages for keyword matching are: (i) the order of keywords is ignored; and (ii) the approximate queries submitted by users are beyond the method of keyword matching can handle. Using keyword matching for Web page search is not satisfactory. This paper proposes a Web search system, named ApproxSeek, to facilitate Web ...

The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2 − o(1). In this paper, we use a collection of simple graph transformations, each of which guarantees an approximation ratio of 3 2 , to find approximate vertex covers for a large collection of randomly generated graphs. These reductions are extremely fast and even though they, by t...

We consider a family of high-order, weighted essentially non-oscillatory central schemes (CWENO) for approximating solutions of one-dimensional hyperbolic systems of conservation laws. We are interested in the behavior of the total variation (TV) of the approximate solution obtained with these methods. Our numerical results suggest that even though CWENO methods are not total variation diminish...

The main purpose of this paper is to study the approximate best proximity pair of cyclic maps and their diameter in fuzzy normed spaces defined by Bag and Samanta. First, approximate best point proximity points on fuzzy normed linear spaces are defined and four general lemmas are given regarding approximate fixed point and approximate best proximity pair of cyclic maps on fuzzy normed spaces. U...

We first construct a sequence of double smooth Picard singular integral operators which do not have to be positive in general. After giving some useful estimates, we mainly show that it is possible to approximate a function by these operators in statistical sense even though they do not obey the positivity condition of the statistical Korovkin theory.