Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2011

Highly Cited

2011

We present a number of new results on one of the most extensively studied topics in computational geometry, orthogonal range… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

Abstract. This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

The recently introduced interconnection networks, the Mobius cubes, are hypercube variants that have some better properties than… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

A zero-skew routing algorithm with clustering and improvement methods is proposed. This algorithm generates a zero-skew routing… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

For pt.I see ibid., vol.34, no.5, p.1123-51 (1988). The family of Barnes-Wall lattices (including D/sub 4/ and E/sub 8/) of… Expand

Is this relevant?

Highly Cited

1982

Highly Cited

1982

Let P be a simple polygon with N vertices, each being assigned a weight ∈ {0,1}, and let C, the weight of P, be the added weight… Expand

Is this relevant?

Highly Cited

1979

Highly Cited

1979

Highly Cited

1979

The problem of construction of planar Voronoi diagrams arises in many areas, one of the most important of which is in nearest… Expand

Is this relevant?

Highly Cited

1974

Highly Cited

1974

Preparata, Metze, and Chien [1] gave necessary conditions for identification of all faulty units in a system S capable of… Expand

Is this relevant?