# Moore neighborhood

## Papers overview

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

2013

2013

- 2013

Edge detection is a fundamental tool in image processing. Several edge detectors have been proposed in literature for enhancingâ€¦Â (More)

Is this relevant?

Highly Cited

2013

Highly Cited

2013

- IEEE Transactions on Signal Processing
- 2013

This paper extends previous results on wavelet filterbanks for data defined on graphs from the case of orthogonal transforms toâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- 2008

Given the emerging focus on improving food environments and food systems through planning, this article investigates racialâ€¦Â (More)

Is this relevant?

2008

2008

- 2008

This paper considers a flexible flow shop scheduling problem, where at least one production stage is made up of unrelatedâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Expert Syst. Appl.
- 2008

K nearest neighbor classifier (K-NN) is widely discussed and applied in pattern recognition and machine learning, however, as aâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- 2007

A group of homeomorphisms of the circle satisfying the "convergence property" is shown to be the restriction of a discrete groupâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- NIPS
- 2006

We focus on the problem of estimating the graph structure associated with a discrete Markov random field. We describe a methodâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- 2005

Islands are generally colonized from mainland areas. Classic examples of islands colonized by mainland species include the floraâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Symposium on Geometry Processing
- 2003

Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require theâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Journal of Communications and Networks
- 2002

A connected dominating set (CDS) for a graph G(V, E) is a subset V' of V, such that each node in V â€” V' is adjacent to some nodeâ€¦Â (More)

Is this relevant?