In graph theory, an adjacent vertex of a vertex v in a graph is a vertex that is connected to v by an edge. The neighbourhood of a vertex v in aâ€¦Â (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2012

Highly Cited

2012

- Mattias P. Heinrich, Mark Jenkinson, +4 authors Julia A. Schnabel
- Medical Image Analysis
- 2012

Deformable registration of images obtained from different modalities remains a challenging task in medical image analysis. Thisâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Ruslan Salakhutdinov, Geoffrey E. Hinton
- AISTATS
- 2007

We show how to pretrain and fine-tune a multilayer neural network to learn a nonlinear transformation from the input space to aâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

3. (a) If F is as in Theorem 10.7, put A = Fâ€²(0), F1(x) = A âˆ’1F(x). Then F1(0) = I. Show that F1(x) = Gnâ—¦Gnâˆ’1â—¦. . .â—¦G1(x) in someâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

In this paper we propose a novel method for learning a Mahalanobis distance measure to be used in the KNN classificationâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Xiaodong Li
- GECCO
- 2004

This paper proposes an improved particle swarm optimizer using the notion of species to determine its neighbourhood best valuesâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- 2000

Describing graphs: Exponents vs. Averages. Power-laws provide a new way to describe topological properties. Average valuesâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

Monte Carlo direct search methods, such as genetic algorithms, simulated annealing etc., are often used to explore a finiteâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

This paper presents a new derivative-free search method for finding models of acceptable data fit in a multidimensional parameterâ€¦Â (More)

Is this relevant?

Highly Cited

1980

Highly Cited

1980

- Godfried T. Toussaint
- Pattern Recognition
- 1980

The relative neighbourhood graph (RNG) of a set of n points on the plane is defined. The ability of the RNG to extract aâ€¦Â (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- K. Chidananda Gowda, G. Krishna
- Pattern Recognition
- 1978

A method for determining the mutual nearest neighbours (MNN) and mutual neighbourhood value (mnv) of a sample point, using theâ€¦Â (More)

Is this relevant?