FAQ

Rank (J programming language)

Known as: J programming language rank, Rank 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1961-2017
0102019612017

Related topics

Related topics

1 relation
Rank (computer programming)

Related mentions per year

Related mentions per year

1961-2018
1960198020002020
Rank (J programming language)
Rank (computer programming)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Low rank approximation and regression in input sparsity time
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
The Möbius Function of the Consecutive Pattern Poset
An occurrence of a consecutive permutation pattern p in a permutation π is a segment of consecutive letters of π whose values… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Stability of graph communities across time scales
The complexity of biological, social, and engineering networks makes it desirable to find natural partitions into clusters (or… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
On the Rank of a Tropical Matrix
This is a foundational paper in tropical linear algebra, which is linear algebra over the min-plus semiring. We compare three… (More)
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Rank-maximal matchings
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)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2000
2000
A Descriptor Systems Toolbox for MATLAB
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
Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations
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
The rank of sparse random matrices over finite fields
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
Adaptive Source Separation with Uniform Performance
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
SUPER-SYMMETRIC DECOMPOSITION of the FOURTH-ORDER CUMULANT TENSOR. BLIND IDENTIFICATION of MORE SOURCES THAN SENSORS
New ideas for Higher-Order Array Processing are introduced. The paper focuses on fourth-order cumulant statistics. They are… (More)
Is this relevant?