Rank in the J programming language has several different meanings. In general, the concept of rank is used to treat an orthogonal array in terms ofâ€¦Â (More)

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

Highly Cited

2013

Highly Cited

2013

- Kenneth L. Clarkson, David P. Woodruff
- STOC
- 2013

We design a new distribution over <i>m</i> Ã— <i>n</i> matrices <i>S</i> so that, for any fixed <i>n</i> Ã— <i>d</i> matrix <i>A</iâ€¦Â (More)

Is this relevant?

2011

2011

- Antonio Bernini, Luca Ferrari, Einar SteingrÃmsson
- Electr. J. Comb.
- 2011

An occurrence of a consecutive permutation pattern p in a permutation Ï€ is a segment of consecutive letters of Ï€ whose valuesâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Jean-Charles Delvenne, Sophia N. Yaliraki, Mauricio Barahona
- Proceedings of the National Academy of Sciencesâ€¦
- 2010

The complexity of biological, social, and engineering networks makes it desirable to find natural partitions into clusters (orâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

This is a foundational paper in tropical linear algebra, which is linear algebra over the min-plus semiring. We compare threeâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch
- SODA
- 2004

Suppose that each member of a set <i>A</i> of applicants ranks a subset of a set <i>P</i> of posts in an order of preferenceâ€¦Â (More)

Is this relevant?

2000

2000

- AndrÃ¡s Varga
- 2000

We describe a recently developed Descriptor Systems Toolbox implemented under Matlab. This Toolbox relies on the object orientedâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Alan M. Frieze, Ravi Kannan, Santosh Vempala
- FOCS
- 1998

We consider the problem of approximating a given <i>m</i> Ã— <i>n</i> matrix <b>A</b> by another matrix of specified rank <i>k</iâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Johannes BlÃ¶mer, Richard M. Karp, Emo Welzl
- Random Struct. Algorithms
- 1997

Let M be a random matrix over GFq] such that for each entry M ij in M and for each non-zero eld element the probability PrrM ijâ€¦Â (More)

Is this relevant?

1994

1994

- Beate H. Laheld, Jean-Frann Cois Cardoso
- 1994

This paper presents a family of adaptive algorithms for the blind separation of independent signals. Source separation consistsâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

New ideas for Higher-Order Array Processing are introduced. The paper focuses on fourth-order cumulant statistics. They areâ€¦Â (More)

Is this relevant?