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.

2019

2019

In this paper, we present a general framework for applying dynamic programming (DP) to discrete memoryless channel (DMC… Expand

Is this relevant?

2018

2018

This study considers a problem of finding an optimal approximation of conditional information measures, like the conditional… Expand

Is this relevant?

2017

2017

This study examines quantization for outputs of binary-input discrete memoryless channels (B-DMCs) by concatenating its output… Expand

Is this relevant?

2014

2014

The quantizer design algorithm was recently proposed by Kurkoski and Yagi for arbitrary binary-input discrete memoryless channels… Expand

Is this relevant?

2010

2010

In this paper we study algorithms for the max-plus product of Monge matrices. These algorithms use the underlying regularities of… Expand

Is this relevant?

2010

2010

In this paper we study algorithms for the max-plus product of Monge matrices. These algorithms use the underlying regularities of… Expand

Is this relevant?

2007

2007

Consider the dynamic program h(n)=min 1≤j≤na(n,j), where a(n,j) is some formula that may (online) or may not (offline) depend on… Expand

Is this relevant?

2006

2006

Consider the Dynamic Program h(n) = min 1≤j≤na(n,j) for n = 1, 2, ..., N. For arbitrary values of a(n,j), calculating all the h(n… Expand

Is this relevant?

2006

2006

There exist several general techniques in the literature for speeding up naive implementations of dynamic programming. Two of the… Expand

Is this relevant?

1998

1998

In this paper we discuss a variation of the classical Huffman coding problem: finding optimal prefix-free codes for unequal… Expand

Is this relevant?