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

2013

Highly Cited

2013

Stochastic neighbor embedding (SNE) and its variants are methods of dimensionality reduction (DR) that involve normalized softmax… Expand

Is this relevant?

Highly Cited

2012

Highly Cited

2012

Ubiquitous in-network caching is one of the key aspects of information-centric networking (ICN) which has recently received… Expand

Is this relevant?

2011

2011

Following Cheon and Shapiro (2008) [3], in this note we compute the average number of protected points in all k-ary trees with n… Expand

Is this relevant?

2009

2009

The antibandwidth problem is to label vertices of a n-vertex graph injectively by 1,2,3,...n, so that the minimum difference… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets

We consider the indexable dictionary problem, which consists of storing a set S ⊆ {0,…,m − 1} for some integer m while supporting… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Numerous methods or algorithms have been designed to solve the problem of nonlinear dimensionality reduction (NLDR). However… Expand

Is this relevant?

Highly Cited

2002

Highly Cited

2002

We consider the <i>indexable dictionary</i> problem which consists in storing a set <i>S</i> ⊆ {0,…, <i>m</i> - 1} for some… Expand

Is this relevant?

2000

2000

A recursive algorithm GenWordsRand a non-recursive algorithmGenWordsNRare presented in this paper to generate sequences for… Expand

Is this relevant?

2000

2000

The bit sequence representation for k-ary trees is a sequence b1,b2,?,bnk+1 of bits that is formed by doing a preorder traversal… Expand

Is this relevant?

Highly Cited

1978

Highly Cited

1978

The problem of ranking a finite set X may be defined as follows: if $|X| = N$, define a linear order on X and find the order… Expand

Is this relevant?