Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

SMAWK algorithm

The SMAWK algorithm is an algorithm for finding the minimum value in each row of an implicitly-defined totally monotone matrix. It is named after the… Expand
Wikipedia

Papers overview

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
  • figure 2
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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
  • figure 1
  • figure 2
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
  • figure 1
  • figure 2
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
  • figure 1
  • figure 2
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
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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
  • figure 1
  • figure 2
  • figure 3
Is this relevant?