Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 205,629,587 papers from all fields of science

Search

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

Highly Cited

2000

Highly Cited

2000

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

Highly Cited

1994

Highly Cited

1994

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

Highly Cited

1993

Highly Cited

1993

The Nordstrom-Robinson, Kerdock, and (slightly modified) Preparata codes are shown to be linear over Z4 , the integers mod 4…

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…

Review

1991

Review

1991

Computational geometry is concerned with the design and analysis of algorithms for geometrical problems. In addition, other more…

Highly Cited

1989

Highly Cited

1989

This thesis introduces Epsilon Geometry, a framework for the development of robust geometric algorithms using inaccurate…

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…

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…

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…

Highly Cited

1972

Highly Cited

1972

This correspondence describes the construction of complex codes of the form exp i \alpha_k whose discrete circular…