, and we observe some surprising phenomena. First, most of these graphs densify over time, with the number of edges growing superlinearly in the number of nodes. Second, the average distance between nodes often shrinks over time, in contrast to the conventional wisdom that such distance parameters should

This paper surveys locally weighted learning, a form of lazy learning and memorybased learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias

w.r.t the vertex set). Our graph property testing algorithms are probabilistic and make assertions which are correct with high probability, utilizing only poly(1=ffl) edge-queries into the graph, where ffl is the distance parameter. Moreover, the property testing algorithms can be used

that respect the metric of the (possibly weighted) graph. Given a graph G we map its vertices to a normed space in an attempt to (i) Keep down the dimension of the host space and (ii) Guarantee a small distortion, i.e., make sure that distances between vertices in G closely match the dis-tances between

We describe two new color indexing techniques. The first one is a more robust version of the commonly used color histogram indexing. In the index we store the cumulative color histograms. The L 1 -, L 2 -, or L1 -distance between two cumulative color histograms can be used to define a similarity

Static vortices close together are studied for two different models in 2-dimensional Euclidean space. In a simple model for one complex field an expansion in the parameters describing the relative position of two vortices can be given in terms of trigonometric and exponential functions. The results

In this paper the vertices of caterpillar tree are viewed with different approach and categorized into the sets, and, based on the distance parameters i.e., diameter and radius. The distance parameters have been presented with some set theory views. Here is the set of diametral vertices, is the set

;identical randomly-moving objects in order to distinguish a change in a target from a change in a distractor; and (b) when the speed and distance parameters of the display are designed so that, on the basis of some very conservative assumptions about the speed of attention movement and encoding times, the predicted

Abstract—In a multicomponent, 2-phase system, the Gibbs dividing surfaces for the respective components are separated by characteristic distances, A, = 17/iXc5. (I) More generally, if b designates an arbitrary criterion defining a surface, e.g. F- = F-, and d designates another criterion, e

Abstract-The matching properties of the threshold voltage, substrate factor, and current factor of MOS transistors have been analyzed and measured. Improvements to the existing theory are given, as well as extensions for long-distance matching and rotation of devices. Matching parameters of several