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...

Spin–orbit alignment (SOA; i.e., the vector between halo spin and orbital angular momentum of neighboring halos) provides an important clue to how galactic momenta develop. For this study, we extract virial-radius-wise contact pairs with mass ratios 1/10 10 from a set cosmological N-body simulations. In spin–orbit angle distribution, find significant SOA in that 52.7% ± 0.2% neighbors are on pr...

The Internet has become a rich and large repository of information about individuals. The links and text on a user's homepage to the mailing lists the user subscribes to are reflections of social interactions a user has in the real world. We devise techniques to mine this information in order to predict relationships between individuals. Further we show that some pieces of information are bette...

In this issue of Neuron, Nauhaus et al. use a combination of optical imaging and multiple electrode recording to demonstrate that the orientation tuning of single cells in primary visual cortex is reliably related to the local structure of the orientation preference map in both cats and monkeys.

C hromosomes, the packaged DNA carriers of heredity and instructions for proper cell functioning, undergo dramatic morphological transformations during the cell-division cycle. In metaphase, which includes the alignment of chromosomes before their separation between the two daughter cells, the 46 chromosomes in a human cell are condensed to such a degree that they can be observed by light micro...