This paper describes a graph clustering algorithm that aims to minimize the normalized cut criterion and has a model order selection procedure. The performance of the proposed algorithm is comparable to spectral approaches in terms of minimizing normalized cut. However unlike spectral approaches, the proposed algorithm scales to graphs with millions of nodes and edges. The algorithm consists of...

This paper describes a graph clustering algorithm that aims to minimize the normalized cut criterion and has a model order selection procedure. The performance of the proposed algorithm is comparable to spectral approaches in terms of minimizing normalized cut. However, unlike spectral approaches, the proposed algorithm scales to graphs with millions of nodes and edges. The algorithm consists o...

Let G be a graph and let A and D be the adjacency matrix of G and diagonal matrix of vertex degrees of G respectively. If each vertex degree is positive, then the normalized adjacency matrix of G is  = D−1/2AD−1/2. A classification is given of those graphs for which the all eigenvalues of the normalized adjacency matrix are integral. The problem of determining those graphs G for which λ ∈ Q fo...

Although it is well known that cross correlation can be efficiently implemented in the transform domain, the normalized form of cross correlation preferred for feature matching applications does not have a simple frequency domain expression. Normalized cross correlation has been computed in the spatial domain for this reason. This short paper shows that unnormalized cross correlation can be eff...

Dear Madam, The P.T. assay, first described in 1935 by Quick et al. soon became the monitoring of oral anticoagulant therapy. The P.T. measures the affect of reduction in the Vit. K dependent coagulant factors II, VII and X. Because the Prothrombin Time Ratio (P.T.R.) is markedly affected by the activity of thromboplastin, the W. It helps to determine the intensity of anti-coagulation therapy b...

The normalized information distance is a universal distance measure for objects of all kinds. It is based on Kolmogorov complexity and thus uncomputable, but there are ways to utilize it. First, compression algorithms can be used to approximate the Kolmogorov complexity if the objects have a string representation. Second, for names and abstract concepts, page count statistics from the World Wid...

In this paper we propose two constructions of dependent normalized random measures, a class of nonparametric priors over dependent probability measures. Our constructions, which we call mixed normalized random measures (MNRM) and thinned normalized random measures (TNRM), involve (respectively) weighting and thinning parts of a shared underlying Poisson process before combining them together. W...

Temporal decorrelations in compressible isotropic turbulence are studied using the space-time correlation theory and direct numerical simulation. A swept-wave model is developed for dilatational components, while the classic random sweeping model is proposed for solenoidal components. The swept-wave model shows that the temporal decorrelations in dilatational fluctuations are dominated by two p...

background: geographic distribution of west nile virus (wnv) is heterogeneous in iran by a high circulation in the southern-western areas. the objective of our study was to determine environmental and climatic factors associ­ated with the risk of wnv equine seropositivity in iran. methods: serological data were obtained from a serosurvey conducted in equine population in 260 districts in iran. ...