Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

2016

Highly Cited

2016

This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise… Expand

Highly Cited

2004

Highly Cited

2004

We propose the class of visibly pushdown languages as embeddings of context-free languages that is rich enough to model program… Expand

Highly Cited

2000

Highly Cited

2000

We address the issue of compressing and indexing data. We devise a data structure whose space occupancy is a function of the… Expand

Highly Cited

2000

Highly Cited

2000

This paper describes a probabilistic syntactic approach to the detection and recognition of temporally extended activities and… Expand

Highly Cited

1992

Highly Cited

1992

We investigate a method for inserting rules into discrete-time second-order recurrent neural networks which are trained to… Expand

Highly Cited

1990

Highly Cited

1990

Memoryless communication channels with arbitrary alphabets where each input symbol is assigned a cost are considered. The maximum… Expand

Highly Cited

1986

Highly Cited

1986

The main theorem allows an elegant algorithm to be refined into an efficient one. The elegant algorithm for constructing a finite… Expand

Highly Cited

1980

Highly Cited

1980

Abstract In the last few years linguistic approach to picture processing has gained in popularity. A scheme for recognizing… Expand

Highly Cited

1965

Highly Cited

1965

Let L(t) = t−1logD(∑piDtni})where pi is the probability of the ith input symbol to a noiseless channel, and ni is the length of… Expand

Highly Cited

1965

Highly Cited

1965

This paper has two purposes. The first is to investigate the characteristics of a restricted class of Turing machines, and to… Expand