We study the interplay between parental and peer socialization in shaping criminal behavior among adolescents. develop a simple cultural transmission model where parents affect how society influences their children's decisions. The predicts that are substitutes development of juvenile crime. then take to data using information on representative sample adolescents United States. Using geographic...

While the K-Nearest-Neighbor (KNN) problem is well studied in the traditional wired, disk-based client-server environment, it has not been tackled in a wireless broadcast environment. In this paper, the problem of organizing location dependent data and answering KNN queries on air are investigated. The linear property of wireless broadcast media and power conserving requirement of mobile device...

We present a review of the literature on fast nearest neighbors using the basic approach from Karger and Ruhl [4] and a recent technique called cover trees. A small error in Insert procedure from the original paper on cover trees is corrected and an examination of how query time actually varies with the size of the problem is shown using a Python implementation of the basic cover tree algorithms.

The In s ti tute for the stu dy of Di p l om acy hosted the spring    m eeti n gs of the Sch l e s i n ger Working Group on the topic of Russian forei gn policy tow a rds its nei gh bors in Cen tral Asia and the Ca u c a su s . The po ten tial for furt h er con f l i ct a l ong Ru s s i a’s peri ph ery is re a l . Russia (ex periencing an econ omic upswing and more assertive po l i tical le...

Retrieving the most similar objects in a large-scale database for a given query is a fundamental building block in many application domains, ranging from web searches, visual, cross media, and document retrievals. Stateof-the-art approaches have mainly focused on capturing the underlying geometry of the data manifolds. Graphbased approaches, in particular, define various diffusion processes on ...

Computing the minimum spanning tree (MST) is a common task in the pattern recognition and the computer vision fields. However, little work has been done on efficient general methods for solving the problem on large datasets where graphs are complete and edge weights are given implicitly by a distance between vertex attributes. In this work we propose a generic algorithm that extends the classic...

Representing data as a linear combination of a set of selected known samples is of interest for various machine learning applications such as dimensionality reduction or classification. k-Nearest Neighbors (kNN) and its variants are still among the best-known and most often used techniques. Some popular richer representations are Sparse Representation (SR) based on solving an l1-regularized lea...

DEFINITION Given a set of n points and a query point, q, the nearest-neighbor problem is concerned with finding the point closest to the query point. Figure 1 shows an example of the nearest neighbor problem. On the left side is a set of n = 10 points in a two-dimensional space with a query point, q. The right shows the problem solution, s. Figure 1: An example of a nearest-neighbor problem dom...

in many industrialized areas, the highest concentration of particulate matter, as a major concern on public health, is being felt worldwide problem. since the air pollution assessment and its evaluation with considering spatial dispersion analysis because of various factors are complex, in this paper, gis-based modeling approach was utilized to zoning pm2.5 dispersion over tehran, during one ye...