In this paper we introduce the k’th isoperimetric constant of a directed graph as the minimum of the mean outgoing normalized flows from a given set of k disjoint subsets of the vertex set of the graph. In this direction we show that the second isoperimetric constant in the general setting coincides with (the mean version of) the classical Cheeger constant of the graph, while for the rest of th...

One of the exciting technologies used to meet increasing demand for wireless communication services is a smart antenna. A antenna basically confirmed by an array antennas and digital beamformer unit through which cellular base station can direct beam toward desired user set nulls interfering users. In this paper, different configurations (linear, circular, planer) with REDS algorithm are implem...

This paper describes a novel algorithm for approximate nearest neighbor searching. For solving this problem especially in high dimensional spaces, one of the best-known algorithm is Locality-Sensitive Hashing (LSH). This paper presents a variant of the LSH algorithm that outperforms previously proposed methods when the dataset consists of vectors normalized to unit length, which is often the ca...

Many fast block-matching algorithms reduce computations by limiting the number of checking points. They can achieve high computation reduction, but often result in relatively higher matching error compared with the full-search algorithm. In this letter, a novel fast block-matching algorithm named normalized partial distortion search is proposed. The proposed algorithm reduces computations by us...